3 papers
cs.FL2026
Generating Fibonacci Words via the Prefix--Suffix Duplication Operation
Diego Cabrera Salamanca, Taylor J. Smith
The finite and infinite Fibonacci words are classical objects in combinatorics on words. Bio-inspired language operations provide a useful tool for studying how finite and infinite…
cs.FL2026
Complexity of Universality and Related Decision Problems for Unary Two-Dimensional Automata
Taylor J. Smith
A two-dimensional automaton is able to move its input head through its input word in four directions: upward, downward, leftward, and rightward. If we prevent the input head from m…
math.DS2026
Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding
Taylor J. Smith
The notion of a two-dimensional word arises naturally in the study of combinatorics on words, while the iterative construction of pedal triangles results in a rich dynamical system…