Variants of codes and indecomposable languages
From MaRDI portal
Publication:1041051
DOI10.1016/j.ic.2009.03.004zbMath1192.68423MaRDI 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
68Q45: Formal languages and automata
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item