Unique Decipherability in the Monoid of Languages: An Application of Rational Relations

DOI10.1007/978-3-642-03351-3_9zbMath1248.94044OpenAlexW1764356098MaRDI QIDQ3392943

Juhani Karhumäki, Christian Choffrut

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_9

zbMATH Keywords

finite automataregular languagesunique decipherability

Mathematics Subject Classification ID

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

Related Items (1)

Unique decipherability in the additive monoid of sets of numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of prime decompositions
• Conjugacy of finite biprefix codes
• A note on decidability questions on presentations of word semigroups
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• The power of commuting with finite sets of words
• A note on multiset decipherable codes
• ON LANGUAGES FACTORIZING THE FREE MONOID
• The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
• Codes conjugués
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• Codes and equations on trees

This page was built for publication: Unique Decipherability in the Monoid of Languages: An Application of Rational Relations