A generalization of automatic sequences
From MaRDI portal
Publication:1114405
The paper deals with sequences of strings from a word semigroup \(A^*\) and gives a connection between the following ideas: (1) generalized systems of enumeration, (2) locally catenative formulas, (3) automata with generalized digits as inputs and (4) fixed points of (certain) morphisms. There has been considerable interest in the cases (1)-(4) in the theory of combinatorics on words and in the theory of automata. The author unifies this problem area in the present work.
Recommendations
Cites work
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Development systems with locally catenative formulas
- Finite automata in number theory
- Folds! II: Symmetry disturbed
- Hierarchie et fermeture de certaines classes de tag-systèmes
- scientific article; zbMATH DE number 3737740 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3324886 (Why is no real title available?)
- Nombres algébriques et substitutions
- Suites algébriques, automates et substitutions
- Systems of Numeration
- Uniform tag sequences
- WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
Cited in
(38)- Fibonacci morphisms and Sturmian words
- Automatic differentiation of characterizing sequences
- On recognizable sets of integers
- Generalization of automatic sequences for numeration systems on a regular language
- Self-generating sets, integers with missing blocks, and substitutions
- \(\beta\)-shift, numeration systems, and automata
- On the boundary sequence of an automatic sequence
- A note on multiplicative automatic sequences
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
- Averages of automatic sequences
- The distribution of elements in automatic double sequences
- Univoque numbers and automatic sequences
- Locally catenative sequences and turtle graphics
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- scientific article; zbMATH DE number 6499262 (Why is no real title available?)
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Transcendental numbers having explicit g-adic and Jacobi-Perron expansions
- scientific article; zbMATH DE number 1548996 (Why is no real title available?)
- Some applications of algebra to automatic sequences
- Abelian properties of Parry words
- Involutive Fibonacci words
- Properties of infinite words: recent results
- A generalization of automatic sequences
- Recognizable sets of numbers in nonstandard bases
- Iterative devices generating infinite words
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- From combinatorial games to shape-symmetric morphisms
- Numeration systems, linear recurrences, and regular sets
- Combinatorics of words and morphisms in some pieces of Tom Johnson
- Automatic sequences and generalised polynomials
- Primitivity of atom Watson-Crick Fibonacci words
- Complexity of automatic sequences
- Substitutions and \(\beta\) systems of numeration
- The reflection complexity of sequences over finite alphabets
- Proof of Irvine's conjecture via mechanized guessing
- Additive word complexity and \texttt{Walnut}
- Mahler equations for Zeckendorf numeration
- Morphic sequences versus automatic sequences
This page was built for publication: A generalization of automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114405)
