TY - GEN

T1 - Prime languages

AU - Kupferman, Orna

AU - Mosheiff, Jonathan

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84885227533&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-40313-2_54

DO - 10.1007/978-3-642-40313-2_54

M3 - Conference contribution

AN - SCOPUS:84885227533

SN - 9783642403125

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 607

EP - 618

BT - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings

T2 - 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013

Y2 - 26 August 2013 through 30 August 2013

ER -