Prime Decompositions of Regular Languages

DOI10.1007/11779148_14MaRDI QIDQ3617053zbMATH OpenOpenAlexFDO

Authors Yo-Sub Han, Kai Salomaa, D. Wood

Publication date 26 March 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779148_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the existence of prime decompositions
• On the decomposition of finite languages
• Length Codes, Products of Languages and Primality
• Variants of codes and indecomposable languages
• On language decompositions and primality

Cited in

(22)

• Variants of codes and indecomposable languages
• Regular component splittable languages
• A non-ambiguous decomposition of regular languages and factorizing codes
• Regular component decomposition of regular languages.
• Prime languages
• On the decomposition of finite languages
• A non-ambiguous language factorization problem
• Prime languages
• Subword complexity and decomposition of the set of factors
• Regular languages of plus- and minus-(in)decomposable permutations
• On language decompositions and primality
• Factorization in formal languages
• scientific article; zbMATH DE number 1750090 (Why is no real title available?)
• scientific article; zbMATH DE number 2162119 (Why is no real title available?)
• A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
• Every regular bifix code is a finite union of regular infix codes
• Theoretical Aspects of Computing – ICTAC 2005
• Implementation and Application of Automata
• On the uniqueness of shuffle on words and finite languages
• Prime normal form and equivalence of simple grammars
• On the existence of prime decompositions
• Deciding determinism of unary languages

This page was built for publication: Prime Decompositions of Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617053)