Relational codes of words
From MaRDI portal
Publication:2465641
DOI10.1016/J.TCS.2007.09.011zbMATH Open1143.68036OpenAlexW1991647001MaRDI QIDQ2465641FDOQ2465641
Authors: Vesa Halava, Tero Harju, Tomi Kärki 
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.011
Recommendations
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Non-standard stringology: algorithms and complexity
- Primitive partial words
- Title not available (Why is that?)
- Jewels of Stringology
- DNA Computing
- Title not available (Why is that?)
- Partial words and a theorem of Fine and Wilf
- Conjugacy on partial words.
- Partial words and a theorem of Fine and Wilf revisited
- Periodicity on partial words
- Local periods and binary partial words: an algorithm
- Codes, orderings, and partial words
- A periodicity result of partial words with one hole
- Deciding multiset decipherability
- Presentations et presentations simplifiables d'un monoide simplifiable
- Partial words and the critical factorization theorem
- Title not available (Why is that?)
- Defect theorems with compatibility relations.
Cited In (11)
- An aperiodicity problem for multiwords
- Relativized codes
- Defect theorems with compatibility relations.
- Similarity relations and repetition-freeness
- Compatibility relations on codes and free monoids
- Codes concerning roots of words
- 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)
