On Sturmian graphs

DOI10.1016/j.dam.2006.11.003zbMath1115.68121OpenAlexW1983015132MaRDI QIDQ881581

Ilaria Venturini, Filippo Mignosi, Chiara Epifanio, Jeffrey O. Shallit

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10447/14526

zbMATH Keywords

Sturmian wordscontinued fractionsrepeatsCDAWGs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Other number representations (11A67)

Related Items (7)

The palindromization map ⋮ Sturmian graphs and integer representations over numeration systems ⋮ On the structure of compacted subword graphs of Thue-Morse words and their applications ⋮ Sturmian and Episturmian Words ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Unnamed Item ⋮ On Lazy Representations and Sturmian Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest automaton recognizing the subwords of a text
• On the distribution of sequences connected with good lattice points
• Real numbers with bounded partial quotients: A survey
• Some combinatorial properties of Sturmian words
• On maximal repeats in strings
• On-line construction of compact directed acyclic word graphs
• Average sizes of suffix trees and DAWGs
• Infinite words with linear subword complexity
• Digital straightness -- a review
• Optimal multipliers for pseudo-random number generation by the linear congruential method
• Reducing space for index implementation.
• Complete inverted files for efficient text retrieval and analysis

This page was built for publication: On Sturmian graphs