Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
IPL
2010
2010
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 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.
Real-time Traffic| Added | 28 Jan 2011 |
| Updated | 28 Jan 2011 |
| Type | Journal |
| Year | 2010 |
| Where | IPL |
| Authors | Bartosz Walczak |
Comments (0)
Researcher Info
|
