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

DOI10.1007/S00224-011-9324-9MaRDI QIDQ639857zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• scientific article; zbMATH DE number 1740158
• scientific article; zbMATH DE number 3883641
• Algorithmic ways of deciding whether an infinite language is a code
• Unique decipherability in the additive monoid of sets of numbers

Cites work

• A note on decidability questions on presentations of word semigroups
• A note on multiset decipherable codes
• Codes and equations on trees
• Codes conjugués
• Conjugacy of finite biprefix codes
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1504577 (Why is no real title available?)
• scientific article; zbMATH DE number 4003548 (Why is no real title available?)
• scientific article; zbMATH DE number 1836425 (Why is no real title available?)
• ON LANGUAGES FACTORIZING THE FREE MONOID
• On the existence of prime decompositions
• Rational sets in commutative monoids
• Semigroups, Presburger formulas, and languages
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• The power of commuting with finite sets of words
• The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
• Unique decipherability in the additive monoid of sets of numbers

Cited in

(2)

• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• Unique decipherability in the additive monoid of sets of numbers

This page was built for publication: Unique decipherability in the monoid of languages: an application of rational relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639857)