ON LANGUAGES FACTORIZING THE FREE MONOID

DOI10.1142/S0218196796000246zbMath0859.68052OpenAlexW2026371368MaRDI QIDQ3837509

Marcella Anselmo, Antonio Restivo

Publication date: 31 March 1997

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

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

zbMATH Keywords

finite languagesfactorizing languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (8)

SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ On Language Decompositions and Primality ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations ⋮ On some Schützenberger conjectures ⋮ A non-ambiguous decomposition of regular languages and factorizing codes

This page was built for publication: ON LANGUAGES FACTORIZING THE FREE MONOID