Conjugacy of finite biprefix codes

DOI10.1016/j.tcs.2009.02.030zbMath1168.68023OpenAlexW2092581570MaRDI QIDQ1019714

Petri Salmela, Juhani Karhumäki, Julien Cassaigne

Publication date: 4 June 2009

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

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

zbMATH Keywords

conjugacylanguage equationbiprefix code

Mathematics Subject Classification ID

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

Related Items

Conjugacy relations of prefix codes ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Towards Decidability of Conjugacy of Pairs and Triples ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations ⋮ Language equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of prime decompositions
• The commutation of finite sets: A challenging problem
• Commutation with ternary sets of words
• Commutation with codes
• The power of commuting with finite sets of words
• Codes et motifs
• On Conjugacy of Languages
• On the simplest centralizer of a language
• Codes conjugués