Unique decipherability in the monoid of languages: an application of rational relations

DOI10.1007/S00224-011-9324-9zbMath1222.68101OpenAlexW1991764466MaRDI QIDQ639857

Christian Choffrut, Juhani Karhumäki

Publication date: 11 October 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9324-9

zbMATH Keywords

finite automataregular languagesunique decipherability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Decoding (94B35)

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
• Unique decipherability in the additive monoid of sets of numbers
• 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