Morphisms on infinite alphabets, countable states automata and regular sequences

DOI10.1016/j.chaos.2017.04.018zbMath1373.11025arXiv1610.03971OpenAlexW2561284090MaRDI QIDQ1674337

Jie-Meng Zhang, Ying-Jun Guo, Jin Chen, Zhi Xiong Wen

Publication date: 2 November 2017

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.03971

zbMATH Keywords

linear recurrenceregular sequencemorphismautomatic sequencecountable states automaton

Mathematics Subject Classification ID

Combinatorics on words (68R15) Recurrences (11B37) Automata sequences (11B85)

Related Items (max. 100)

Some properties of the Fibonacci sequence on an infinite alphabet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties and limits of recognition of sets of integers by countable automata
• Analytic functions over \(\mathbb Z_p\) and \(p\)-regular sequences
• Substitutions in dynamics, arithmetics and combinatorics
• On some questions regarding \(k\)-regular and \(k\)-context-free sequences
• On complexity functions of infinite words associated with generalized Dyck languages
• Avoiding squares and overlaps over the natural numbers
• Finite automata in number theory
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• On the regular sum-free sets
• Substitution dynamical systems on infinite alphabets
• On the complexity of infinite words generated by countable \(q\)-automata
• Arithmetics properties of substitutions and infinite automata
• THE MINIMAL GROWTH OF A -REGULAR SEQUENCE
• Drunken man infinite words complexity
• Non-Regularity of ⌊α + log k n⌋
• Suites algébriques, automates et substitutions
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Uniform tag sequences

This page was built for publication: Morphisms on infinite alphabets, countable states automata and regular sequences