Compatibility relations on codes and free monoids

DOI10.1051/ITA:2008016zbMATH Open1149.68069OpenAlexW2031839974MaRDI QIDQ3526416FDOQ3526416

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

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¹

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Relational codes of words
• Defect theorems with compatibility relations.
• Relationally Periodic Sequences and Subword Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)