A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES

DOI10.1142/S0218196705002116zbMATH Open1102.68052OpenAlexW2063145078MaRDI QIDQ4680586FDOQ4680586

Authors: Sergey Avgustinovich, Anna Frid 

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

Recommendations

• Canonical decomposition of catenation of factorial languages
• On the decomposition of finite languages
• On the existence of prime decompositions
• Prime Decompositions of Regular Languages
• scientific article; zbMATH DE number 2162119

zbMATH Keywords

language equationscatenation of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The commutation of finite sets: A challenging problem

Cited In (14)

• On the existence of prime decompositions
• Variants of codes and indecomposable languages
• A non-ambiguous decomposition of regular languages and factorizing codes
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Decompositions in semirings
• Canonical decomposition of catenation of factorial languages
• On the Quantized Dynamics of Factorial Languages
• On intermediate factorial languages
• Subword complexity and decomposition of the set of factors
• Length Codes, Products of Languages and Primality
• Factorization in formal languages
• ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES
• Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
• Simple equations on binary factorial languages

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

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