Sums and rational multiples of q-automatic sequences are q-automatic
Theoretical Computer Science
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Limit values of the recurrence quotient of Sturmian sequences
Theoretical Computer Science
The index of Sturmian sequences
European Journal of Combinatorics
Sur les mots sans carré définis par un morphisme
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
If a D0L Language is k-Power Free then it is Circular
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Some properties of the factors of Sturmian sequences
Theoretical Computer Science
On critical exponents in fixed points of non-erasing morphisms
Theoretical Computer Science
Reversals and palindromes in continued fractions
Theoretical Computer Science
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
On the periodicity of morphic words
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Note: Lexicographically least words in the orbit closure of the Rudin-Shapiro word
Theoretical Computer Science
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic complexity of ultimately periodic sets of integers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Enumeration and decidable properties of automatic sequences
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Automatic theorem-proving in combinatorics on words
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately periodic. We prove that it is decidable whether a given k-automatic sequence is overlap-free (or squarefree, or cubefree, etc.). We prove that the lexicographically least sequence in the orbit closure of a k-automatic sequence is k-automatic, and use this last result to show that several related quantities, such as the critical exponent, irrationality measure, and recurrence quotient for Sturmian words with slope @a, have automatic continued fraction expansions if @a does.