2025/03/02 by Shallit, Jeffrey · 3 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2503.01026
The Narayana morphism ν maps 0 → 01, 1 → 2, 2 → 0 and has a fixed point n = n0 n1 n2 ⋯ = \tt 0120010120120⋯. In this paper we study the properties of this word and related words using automata theory.