A non-ambiguous language factorization problem

MaRDI QIDQ2708959zbMATH OpenFDO

Authors Marcella Anselmo

Publication date 4 November 2002

zbMATH Keywords

regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A non-ambiguous decomposition of regular languages and factorizing codes
• ON LANGUAGES FACTORIZING THE FREE MONOID
• On the decomposition of finite languages
• Prime Decompositions of Regular Languages
• On some factorization problems

Cited in

(8)

• On some factorization problems
• Some combinatorial results on Bernoulli sets and codes
• A non-ambiguous decomposition of regular languages and factorizing codes
• Regular component decomposition of regular languages.
• On a complete set of operations for factorizing codes
• An algorithm for the decomposition of finite languages
• ON LANGUAGES FACTORIZING THE FREE MONOID
• scientific article; zbMATH DE number 2040895 (Why is no real title available?)

This page was built for publication: A non-ambiguous language factorization problem

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