3 papers
cs.FL2026
Complexity of Linear Subsequences of -Automatic Sequences
Delaram Moradi, Narad Rampersad, Jeffrey Shallit
We construct automata with input(s) in base recognizing some basic relations and study their number of states. We also consider some basic operations on -automatic sequences…
cs.FL2026
Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
Delaram Moradi, Narad Rampersad, Jeffrey Shallit
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of stat…
cs.FL2026
State Complexity of Shifts of the Fibonacci Word
Delaram Moradi, Pierre Popoli, Jeffrey Shallit +1
The Fibonacci infinite word is one of the most celebrated objects in combinatorics on words. There is a simple -state automaton tha…