Compatibility relations on codes and free monoids

DOI10.1051/ITA:2008016MaRDI QIDQ3526416zbMATH OpenOpenAlexFDO

Authors Tomi Kärki

Publication date 25 September 2008

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

Full work available at URL https://eudml.org/doc/92887, https://semanticscholar.org/paper/7c3b259f8703330d3f234980223d05c67bd1989f

zbMATH Keywords

Sardinas-Patterson algorithm

Mathematics Subject Classification ID

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

Recommendations

• Relational codes of words
• Defect theorems with compatibility relations.
• Algorithmic ways of deciding whether an infinite language is a code
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• Relations on free monoids, their independent sets, and codes¹

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Codes, orderings, and partial words
• DNA Computing
• Defect theorems with compatibility relations.
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Jewels of Stringology
• Many aspects of defect theorems
• Partial words and a theorem of Fine and Wilf
• Presentations et presentations simplifiables d'un monoide simplifiable
• Relational codes of words
• Sur le théorème du defaut
• The decidability of the dol prefix problem
• The intersection of free submonoids of a free monoid is free

Cited in

(8)

• scientific article; zbMATH DE number 2068875 (Why is no real title available?)
• Relational codes of words
• Defect theorems with compatibility relations.
• Relationally Periodic Sequences and Subword Complexity
• scientific article; zbMATH DE number 7774245 (Why is no real title available?)
• scientific article; zbMATH DE number 3895249 (Why is no real title available?)
• Relations on words
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson

This page was built for publication: Compatibility relations on codes and free monoids

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