USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS
From MaRDI portal
Publication:3655533
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)
Related Items
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, ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS
Cites Work