Commutation with codes

DOI10.1016/j.tcs.2005.03.037zbMath1079.68051OpenAlexW2017961583MaRDI QIDQ2484442

Ion Petre, Michel Latteux, Juhani Karhumäki

Publication date: 1 August 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.037

zbMATH Keywords

CodesCentralizerCommutationConway's problemPrefix codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items

Conjugacy relations of prefix codes ⋮ Playing with Conway's problem ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Sub-classes of the monoid of left cancellative languages ⋮ Simple equations on binary factorial languages ⋮ Conjugacy of finite biprefix codes ⋮ Language equations ⋮ On the simplest centralizer of a language

Cites Work

• The commutation of finite sets: A challenging problem
• Commutation with ternary sets of words
• Conway's problem for three-word sets.
• Codes et motifs
• Automata, Languages and Programming
• Centralizers in Free Associative Algebras
• Codes conjugués
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item