Compatibility relations on codes and free monoids
From MaRDI portal
Publication:3526416
DOI10.1051/ita:2008016zbMath1149.68069OpenAlexW2031839974MaRDI QIDQ3526416
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
Combinatorics on words (68R15) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Codes, orderings, and partial words
- Sur le théorème du defaut
- Presentations et presentations simplifiables d'un monoide simplifiable
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Partial words and a theorem of Fine and Wilf
- Many aspects of defect theorems
- Relational codes of words
- Defect theorems with compatibility relations.
- The intersection of free submonoids of a free monoid is free
- The decidability of the dol prefix problem
- Jewels of Stringology
- DNA Computing
This page was built for publication: Compatibility relations on codes and free monoids