A generalization of automatic sequences
From MaRDI portal
DOI10.1016/0304-3975(88)90103-XzbMATH Open0662.68052MaRDI QIDQ1114405FDOQ1114405
Authors: Jeffrey Shallit 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Suites algébriques, automates et substitutions
- Title not available (Why is that?)
- Uniform tag sequences
- Finite automata in number theory
- Hierarchie et fermeture de certaines classes de tag-systèmes
- Nombres algébriques et substitutions
- WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
- Title not available (Why is that?)
- Systems of Numeration
- Title not available (Why is that?)
- Folds! II: Symmetry disturbed
- Title not available (Why is that?)
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Development systems with locally catenative formulas
Cited In (34)
- Fibonacci morphisms and Sturmian words
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Morphic sequences versus automatic sequences
- Title not available (Why is that?)
- A generalization of automatic sequences
- Automatic sequences and generalised polynomials
- Recognizable sets of numbers in nonstandard bases
- On the boundary sequence of an automatic sequence
- Iterative devices generating infinite words
- A note on multiplicative automatic sequences
- On recognizable sets of integers
- Title not available (Why is that?)
- Generalization of automatic sequences for numeration systems on a regular language
- \(\beta\)-shift, numeration systems, and automata
- Univoque numbers and automatic sequences
- Self-generating sets, integers with missing blocks, and substitutions
- Some applications of algebra to automatic sequences
- From combinatorial games to shape-symmetric morphisms
- Properties of infinite words: recent results
- Combinatorics of words and morphisms in some pieces of Tom Johnson
- Averages of automatic sequences
- Automatic differentiation of characterizing sequences
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- Abelian properties of Parry words
- Involutive Fibonacci words
- Substitutions and \(\beta\) systems of numeration
- The distribution of elements in automatic double sequences
- Title not available (Why is that?)
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
- Transcendental numbers having explicit $g$-adic and Jacobi-Perron expansions
- Numeration systems, linear recurrences, and regular sets
- Locally catenative sequences and turtle graphics
- Complexity of 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)
