Sciweavers

Share
IPL
2010
69views more  IPL 2010»
8 years 1 months ago
A simple representation of subwords of the Fibonacci word
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 backwa...
Bartosz Walczak
STRINGOLOGY
2008
8 years 4 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
books