Abstract
This paper discusses the state complexity of projected regular languages represented by incomplete deterministic finite automata. It is shown that the known upper bound is reachable only by automata with one unobservable transition, that is, a transition labeled with a symbol removed by the projection. The present paper improves this upper bound by considering the structure of the automaton. It also proves that the new bounds are tight, considers the case of finite languages, and presents several open problems. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Jirásková, G., & Masopust, T. (2011). State complexity of projected languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6808 LNCS, pp. 198–211). https://doi.org/10.1007/978-3-642-22600-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
