Prime languages

Orna Kupferman; Jonathan Mosheiff

doi:https://doi.org/10.1007/978-3-642-40313-2_54

Prime languages

Orna Kupferman, Jonathan Mosheiff

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We say that a deterministic finite automaton (DFA) A is composite if there are DFAs A₁,...,A_t such that L(A) = ∩ _i=1^t L(A_i) 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.

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
Pages	607-618
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-40313-2_54
State	Published - 15 Oct 2013
Event	38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 - Klosterneuburg, Austria Duration: 26 Aug 2013 → 30 Aug 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8087 LNCS

Conference

Conference	38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013
Country/Territory	Austria
City	Klosterneuburg
Period	26/08/13 → 30/08/13

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-642-40313-2_54

Cite this

Kupferman, O., & Mosheiff, J. (2013). Prime languages. In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings (pp. 607-618). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8087 LNCS). https://doi.org/10.1007/978-3-642-40313-2_54

@inproceedings{7028fc3a37b64a2ab47aae1f5d67edf1,

title = "Prime languages",

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.",

author = "Orna Kupferman and Jonathan Mosheiff",

year = "2013",

month = oct,

day = "15",

doi = "https://doi.org/10.1007/978-3-642-40313-2_54",

language = "الإنجليزيّة",

isbn = "9783642403125",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "607--618",

booktitle = "Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings",

note = "38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 ; Conference date: 26-08-2013 Through 30-08-2013",

}

Kupferman, O & Mosheiff, J 2013, Prime languages. in Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8087 LNCS, pp. 607-618, 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria, 26/08/13. https://doi.org/10.1007/978-3-642-40313-2_54

Prime languages. / Kupferman, Orna ; Mosheiff, Jonathan.
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. 2013. p. 607-618 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8087 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Prime languages

AU - Kupferman, Orna

AU - Mosheiff, Jonathan

PY - 2013/10/15

Y1 - 2013/10/15

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 - https://doi.org/10.1007/978-3-642-40313-2_54

DO - https://doi.org/10.1007/978-3-642-40313-2_54

M3 - منشور من مؤتمر

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 -

Prime languages

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this