ON THE ROOT OF LANGUAGES

DOI10.1142/S0218196701000711zbMath1022.68071OpenAlexW2094709030MaRDI QIDQ4786297

Paolo Massazza

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196701000711

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A non-ambiguous decomposition of regular languages and factorizing codes

Cites Work

• On equations for regular languages, finite automata, and sequential networks
• Codes et motifs

This page was built for publication: ON THE ROOT OF LANGUAGES