Abstract
We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with at most 2 n states, where n is the maximal length of words in L. Our constructions are based on the De Bruijn graph. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Gusev, V. V., Maslennikova, M. I., & Pribavkina, E. V. (2013). Finitely generated ideal languages and synchronizing automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8079 LNCS, pp. 143–153). Springer Verlag. https://doi.org/10.1007/978-3-642-40579-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
