Unique decipherability in the additive monoid of sets of numbers

DOI10.1051/ita/2011018zbMath1218.68108OpenAlexW2136451926MaRDI QIDQ5198933

Aleksi Saarela

Publication date: 10 August 2011

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222059

zbMATH Keywords

sumsetunique decipherabilityrational set

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• The power of commuting with finite sets of words
• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• The Frobenius Problem in a Free Monoid
• Codes conjugués
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• On a Problem of Partitions