Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"subword complexity"”.
-
Transcendence of numbers related to Episturmian words
… is that numbers whose b- expansion has low subword complexity are either rational or transcendental. This heuristic was confirmed by Ferenczi and Maduit, who proved that for b > 1 an inte- ger, numbers whose b-expansion is a Sturmian sequence or an Arnoux-Rauzy sequence are transcendental. …
-
New Methods for Analyzing the Properties of Automatic Sequences
… words, including the critical exponent and subword complexity. In the first part of this thesis, Chapters 2 to 4, we introduce the notion of self-verifying predicates, which are logical predicates capable of verifying their own correctness. We show how this property enables verification of …
-
A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA
… Finally, we answer the open question on subword complexity, which asks if any real in the unit interval acts as a value for subword complexity. As for study of groups, it proceeds in two directions. Firstly, presentations of various Lamplighter groups using transducers are studied. …
-
Automatic Sequences and Decidable Properties: Implementation and Applications
… On the more theoretical side, we show that the subword complexity p(n) of k-automatic sequences is k-synchronized, i.e., the language of pairs (n, p(n)) (expressed in base k) is accepted by an automaton. Furthermore, we prove that the Lyndon factorization of k-automatic sequences is also …