Unambiguous multiplication of formal languages

DOI10.3103/S0027132225700470MaRDI QIDQ6850569zbMATH OpenFDO

Authors F. D. Kholodilov

Publication date 2 March 2026

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132225700470

zbMATH Keywords

formal languagesfree monoidlanguage factorizationmixed radix numeral systemsunambiguous concatenation

Mathematics Subject Classification ID

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

Cites work

• A non-ambiguous decomposition of regular languages and factorizing codes
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• ON LANGUAGES FACTORIZING THE FREE MONOID
• On simple number systems.
• On some factorization problems
• Orthogonal concatenation: language equations and state complexity

This page was built for publication: Unambiguous multiplication of formal languages

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