Border correlation of binary words
From MaRDI portal
Publication:703695
DOI10.1016/J.JCTA.2004.07.009zbMATH Open1094.68072OpenAlexW1967472300MaRDI QIDQ703695FDOQ703695
Authors: Dirk Nowotka, Tero Harju 
Publication date: 11 January 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.07.009
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unbordered factors of the characteristic sequences of irrational numbers
- Rotations of Periodic Strings and Short Superstrings
- Relationship between the period of a finite word and the length of its unbordered segments
- Periodicity and unbordered segments of words
- String overlaps, pattern matching, and nontransitive games
- Counting distinct strings
- Biinfinite words with maximal recurrent unbordered factors.
- On the construction of maximal prefix-synchronized codes
- Density of Critical Factorizations
Cited In (9)
- Combinatorics on partial word borders
- Abelian borders in binary words
- On the number of frames in binary words
- Involutively bordered words
- Fully bordered words
- Bordered conjugates of words over large alphabets
- Border correlations of partial words
- Border correlations, lattices, and the subgraph component polynomial
- Border correlations, lattices, and the subgraph component polynomial
This page was built for publication: Border correlation of binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703695)
