Abstract
In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gao, Y., & Yu, S. (2011). State complexity of four combined operations composed of union, intersection, star and reversal. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6808 LNCS, pp. 158–171). https://doi.org/10.1007/978-3-642-22600-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
