Abstract
We say that a deterministic finite automaton (DFA) A is composite if there are DFAs A1,...,At such that L(A) = ∩ i=1t L(Ai) and the index of every is strictly smaller than the index of . Otherwise, is prime. We study the problem of deciding whether a given DFA is composite, the number of DFAs required in a decomposition, methods to prove primality, and structural properties of DFAs that make the problem simpler or are retained in a decomposition. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Kupferman, O., & Mosheiff, J. (2013). Prime languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8087 LNCS, pp. 607–618). https://doi.org/10.1007/978-3-642-40313-2_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
