Showing cs.FLShow all
2 papers · 1 filter
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.FL2024
String Attractors for Automatic Sequences
Luke Schaeffer, Jeffrey Shallit
We show that it is decidable, given an automatic sequence and a constant , whether all prefixes of have a string attractor of size . Using a decision pro…