An algorithm for the decomposition of finite languages

DOI10.1093/JIGPAL/JZP032MaRDI QIDQ3577905zbMATH OpenOpenAlexFDO

Authors

Publication date 26 July 2010

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzp032

zbMATH Keywords

catenationfactorisationfinite languagelanguage decompositionprime language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the decomposition of finite languages
• A non-ambiguous language factorization problem
• scientific article; zbMATH DE number 1773088
• On language decompositions and primality
• A non-ambiguous decomposition of regular languages and factorizing codes

Cited in

(9)

• Inductive synthesis of cover-grammars with the help of ant colony optimization
• Codes induced by alternative codes
• A non-ambiguous decomposition of regular languages and factorizing codes
• Parsing with a finite dictionary
• An Algebraic Characterization of Strictly Piecewise Languages
• scientific article; zbMATH DE number 3919851 (Why is no real title available?)
• scientific article; zbMATH DE number 3960994 (Why is no real title available?)
• Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
• Dynamic algorithms for the Dyck languages

This page was built for publication: An algorithm for the decomposition of finite languages

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