A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the structure of compacted subword graphs of Thue–Morse words and their applications
2012
Journal of Discrete Algorithms
We investigate how syntactic properties of Thue-Morse words are related to special type of automata/graphs. The directed acyclic subword graph (dawg, in short) is a useful deterministic automaton accepting all suxes of the word. Its compacted version (resulted by compressing chains of states) is denoted by cdawg. The cdawgs of Thue-Morse words have regular and very simple structure, in particular they oer a powerful (exponential) compression of the set of all subwords in case of nite Thue-Morse
doi:10.1016/j.jda.2011.01.001
fatcat:zwcdbja6azbulpp3d42pkdb2fe