Morphisms on infinite alphabets, countable states automata and regular sequences
From MaRDI portal
Publication:1674337
DOI10.1016/J.CHAOS.2017.04.018zbMATH Open1373.11025arXiv1610.03971OpenAlexW2561284090MaRDI QIDQ1674337FDOQ1674337
Authors: Jiemeng Zhang, Jin Chen, Ying-Jun Guo, Zhixiong Wen 
Publication date: 2 November 2017
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Abstract: In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the regularity of some regular sequences is invariant under some codings.
Full work available at URL: https://arxiv.org/abs/1610.03971
Recommendations
- Automaton transformations and monadic theories of infinite sequences
- scientific article; zbMATH DE number 3983141
- Infinity problems and countability problems for \(\omega \)-automata
- Automata over infinite alphabets
- scientific article; zbMATH DE number 1522569
- Automata over infinite sequences of reals
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- Automata and Logics for Words and Trees over an Infinite Alphabet
- scientific article; zbMATH DE number 1834677
Cites Work
- The minimal growth of a \(k\)-regular sequence
- The ring of \(k\)-regular sequences
- Suites algébriques, automates et substitutions
- Automatic Sequences
- Uniform tag sequences
- Finite automata in number theory
- The ring of \(k\)-regular sequences. II.
- Title not available (Why is that?)
- Avoiding squares and overlaps over the natural numbers
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Substitution dynamical systems on infinite alphabets
- Arithmetics properties of substitutions and infinite automata
- Enumeration and decidable properties of automatic sequences
- Analytic functions over \(\mathbb Z_p\) and \(p\)-regular sequences
- Title not available (Why is that?)
- On the complexity of infinite words generated by countable \(q\)-automata
- Drunken man infinite words complexity
- Properties and limits of recognition of sets of integers by countable automata
- On complexity functions of infinite words associated with generalized Dyck languages
- On some questions regarding \(k\)-regular and \(k\)-context-free sequences
- On the regular sum-free sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-Regularity of ⌊α + log k n⌋
Cited In (3)
This page was built for publication: Morphisms on infinite alphabets, countable states automata and regular sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1674337)
