An algorithm for the decomposition of finite languages

DOI10.1093/JIGPAL/JZP032zbMATH Open1192.68425OpenAlexW2106406533MaRDI QIDQ3577905FDOQ3577905

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

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

zbMATH Keywords

factorisationfinite languagecatenationprime languagelanguage decomposition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

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

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)