Prime languages

Orna Kupferman, Jonathan Mosheiff

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
Pages607-618
Number of pages12
DOIs
StatePublished - 15 Oct 2013
Externally publishedYes
Event38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 - Klosterneuburg, Austria
Duration: 26 Aug 201330 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8087 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013
Country/TerritoryAustria
CityKlosterneuburg
Period26/08/1330/08/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Prime languages'. Together they form a unique fingerprint.

Cite this