A generalization of automatic sequences (Q1114405): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:32, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A generalization of automatic sequences |
scientific article |
Statements
A generalization of automatic sequences (English)
0 references
1988
0 references
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.
0 references
automatic sequences
0 references
coding homomorphism
0 references
Fibonacci sequence
0 references
combinatorics on words
0 references