A simple representation of subwords of the Fibonacci word

Authors:
Bartosz Walczak
Affiliations:
Department of Theoretical Computer Science, Jagiellonian University, ul. Łojasiewicza 6, 30-348 Kraków, Poland
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

A representation theorem of the suffixes of characteristic sequences

Discrete Applied Mathematics
Locating factors of the infinite Fibonacci word

Theoretical Computer Science
The structure of subword graphs and suffix trees of Fibonacci words

Theoretical Computer Science - Implementation and application of automata
Compressed string-matching in standard Sturmian words

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce a representation of subwords of the infinite Fibonacci word f"~ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backward processing of the given word. This provides an efficient recognition algorithm for subwords of f"~ as well as a full description of their occurrences in f"~. Our representation yields a natural notion of rank of a subword, which explains main properties of subwords of f"~ in a unified way.