Relational codes of words
From MaRDI portal
Publication:2465641
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1114032 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- A periodicity result of partial words with one hole
- Codes, orderings, and partial words
- Conjugacy on partial words.
- DNA Computing
- Deciding multiset decipherability
- Defect theorems with compatibility relations.
- Introduction to algorithms
- Jewels of Stringology
- Local periods and binary partial words: an algorithm
- Non-standard stringology: algorithms and complexity
- Partial words and a theorem of Fine and Wilf
- Partial words and a theorem of Fine and Wilf revisited
- Partial words and the critical factorization theorem
- Periodicity on partial words
- Presentations et presentations simplifiables d'un monoide simplifiable
- Primitive partial words
Cited in
(11)- Relativized codes
- An aperiodicity problem for multiwords
- Defect theorems with compatibility relations.
- Similarity relations and repetition-freeness
- Codes concerning roots of words
- Compatibility relations on codes and free monoids
- The theorem of Fine and Wilf for relational periods
- Overlap-freeness in infinite partial words
- Relations on words
- Codes, orderings, and partial words
- \((r,k)\)-catching code
This page was built for publication: Relational codes of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465641)
