USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS

DOI10.1142/S0129054109007017zbMath1187.68357MaRDI QIDQ3655533

Marcin Piątkowski, Paweł Baturo, Wojciech Rytter

Publication date: 8 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Sturmian wordsnumeration systemssubword graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS ⋮ Sturmian graphs and integer representations over numeration systems ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ Compressed string-matching in standard Sturmian words

Cites Work

• The structure of subword graphs and suffix trees of Fibonacci words
• Automatic Sequences
• Jewels of Stringology
• Density of Critical Factorizations

This page was built for publication: USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS