Complexity of Linear Subsequences of k-Automatic Sequences
- 5 August 2026
- book chapter
- Published by Springer Nature
- p. 185-199
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- State Complexity of Shifts of the Fibonacci Word2026
- Complexity of Linear Subsequences of Fibonacci-Automatic Sequences2026
- On the Construction of Automata from Linear Arithmetic ConstraintsLecture Notes in Computer Science, 2000
- The Ubiquitous Prouhet-Thue-Morse Sequence1999
- Diophantine equations, Presburger arithmetic and finite automataLecture Notes in Computer Science, 1996
- The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence1996
- The state complexities of some basic operations on regular languagesTheoretical Computer Science, 1994
- Uniform tag sequencesTheory of Computing Systems, 1972
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON1971
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969