Abstract
In this paper, we study the state complexities of and , where L i , 1 ≥ i ≥ k, k ≥ 2 are regular languages. We obtain exact bounds for both of these multiple combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gao, Y., & Kari, L. (2012). State complexity of star and square of union of k regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 155–168). https://doi.org/10.1007/978-3-642-31623-4_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
