State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation
Formal Languages and Automata Theory
2010-06-25 v1
Abstract
In this paper, we show that, due to the structural properties of the resulting automaton obtained from a prior operation, the state complexity of a combined operation may not be equal but close to the mathematical composition of the state complexities of its component operations. In particular, we provide two witness combined operations: reversal combined with catenation and star combined with catenation.
Cite
@article{arxiv.1006.4646,
title = {State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation},
author = {Bo Cui and Yuan Gao and Lila Kari and Sheng Yu},
journal= {arXiv preprint arXiv:1006.4646},
year = {2010}
}
Comments
20 pages, 7 figures