Variants of codes and indecomposable languages

DOI10.1016/j.ic.2009.03.004zbMath1192.68423OpenAlexW2084532813MaRDI QIDQ1041051

Arto Salomaa, Kai Salomaa, Sheng Yu

Publication date: 27 November 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.03.004

zbMATH Keywords

decompositionlanguageprime decompositioncatenation of languageslength codestar language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On Language Decompositions and Primality ⋮ On the decomposition of prefix codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of prime decompositions
• The power of commuting with finite sets of words
• On multiset decipherable codes (Corresp.)
• A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
• The finest homophonic partition and related code concepts
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Commutation of Binary Factorial Languages
• Implementation and Application of Automata
• LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES

This page was built for publication: Variants of codes and indecomposable languages