A characterization of the squares in a Fibonacci string
From MaRDI portal
Publication:1392029
DOI10.1016/S0304-3975(96)00141-7zbMath0903.68050MaRDI QIDQ1392029
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68P10: Searching and sorting
Related Items
Simple and flexible detection of contiguous repeats using a suffix tree, The exact number of squares in Fibonacci words, Euclidean strings, Finding approximate repetitions under Hamming distance., Repetitions in Sturmian strings, Repetitive perhaps, but certainly not boring, Two-pattern strings. I: A recognition algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the repetitions in a word
- A combinatorial property of the Fibonacci words
- Optimal off-line detection of repetitions in a string
- An optimal algorithm to compute all the covers of a string
- An O(n log n) algorithm for finding all repetitions in a string
- Fast Pattern Matching in Strings
- Semantics of context-free languages: Correction