A generalization of automatic sequences
type: Item
instance of: scholarly article
title: A generalization of automatic sequences
zbMATH Open document ID: 0662.68052
DOI: 10.1016/0304-3975(88)90103-X
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 11B83
zbMATH DE Number: 4082983
zbMATH Keywords: automatic sequences
zbMATH Keywords: coding homomorphism
zbMATH Keywords: Fibonacci sequence
zbMATH Keywords: combinatorics on words
author: Jeffrey Shallit
reviewed by: Tero Harju
MaRDI profile type: Publication
cites work: Finite automata in number theory
cites work: WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
cites work: Q3924262
cites work: Suites algébriques, automates et substitutions
cites work: Uniform tag sequences
cites work: Folds! II: Symmetry disturbed
cites work: Q4079524
cites work: Systems of Numeration
cites work: Q5592246
cites work: Hierarchie et fermeture de certaines classes de tag-systèmes
cites work: Nombres algébriques et substitutions
cites work: Development systems with locally catenative formulas
cites work: Beatty Sequences, Continued Fractions, and Certain Shift Operators
cites work: Q5603911
description: scientific article; zbMATH DE number 4082983