A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES

DOI10.1142/S0218196705002116zbMath1102.68052OpenAlexW2063145078MaRDI QIDQ4680586

Anna E. Frid, Sergei V. Avgustinovich

Publication date: 7 June 2005

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

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

zbMATH Keywords

language equationscatenation of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Subword Complexity and Decomposition of the Set of Factors ⋮ On the existence of prime decompositions ⋮ Quotient complexity of closed languages ⋮ Decompositions in semirings ⋮ Length Codes, Products of Languages and Primality ⋮ Simple equations on binary factorial languages ⋮ ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES ⋮ Variants of codes and indecomposable languages

Cites Work

• The commutation of finite sets: A challenging problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES