2 papers
cs.FL2026
2-Head 2D Returning Finite Automata
Henning Fernau, Benedek Nagy, R. Jennifer Rose +2
We introduce and study a family of two-head finite automata called two head returning finite automata (2-HRFA) operating on rectangular arrays of picture languages, in which both h…
cs.FL2025
On a Generalization of the Christoffel Tree: Epichristoffel Trees
Abhishek Krishnamoorthy, Robinson Thamburaj, Durairaj Gnanaraj Thomas
Sturmian words form a family of one-sided infinite words over a binary alphabet that are obtained as a discretization of a line with an irrational slope starting from the origin. A…