AbstractLet x=(x1,x2,…) with the xi elements of afinite set A be an automatic sequence, i.e., x is generated by a tag machine with deletion number one. Let F be a finite set and suppose maps ϕa:F→F are given for all aϵA. It is shown constructively that the sequence of iterates (ϕx1, ϕx2 o ϕx1, ϕx3 o ϕx2 o ϕx1,…) is again an automatic sequence
This work deals mainly with automata theory, mathematical logic and their applications. In the first...
AbstractGiven a finite automaton, its infinite behavior is defined by Büchi (1962), Eilenberg (1974)...
This book is the first integrated treatment of sequences generated by finite automata and their gene...
AbstractBlanchard and Fabre (1994) have considered description of symbolic systems by sequences obta...
We give a criterion for a sequence (a_n)_{n >= 1} to be non-automatic, i.e., for when there does not...
AbstractLet L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite ...
AbstractWe generalize the uniform tag sequences of Cobham, which arise as images of fixed points of ...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
Many sequences of p-adic integers project modulo pα to p-automatic sequences for every α≥0. Examples...
peer reviewedWe show that various aspects of k-automatic sequences such as having an unbordered fa...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
Let L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite determin...
peer reviewedThe nth term of an automatic sequence is the output of a deterministic finite automaton...
International audienceWe study those automatic sequences which are produced by an automaton whose un...
AbstractThe theory of codes and finite automata is applied to prove the existence of codes suitable ...
This work deals mainly with automata theory, mathematical logic and their applications. In the first...
AbstractGiven a finite automaton, its infinite behavior is defined by Büchi (1962), Eilenberg (1974)...
This book is the first integrated treatment of sequences generated by finite automata and their gene...
AbstractBlanchard and Fabre (1994) have considered description of symbolic systems by sequences obta...
We give a criterion for a sequence (a_n)_{n >= 1} to be non-automatic, i.e., for when there does not...
AbstractLet L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite ...
AbstractWe generalize the uniform tag sequences of Cobham, which arise as images of fixed points of ...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
Many sequences of p-adic integers project modulo pα to p-automatic sequences for every α≥0. Examples...
peer reviewedWe show that various aspects of k-automatic sequences such as having an unbordered fa...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
Let L be an infinite regular language on a totally ordered alphabet (Σ,<). Feeding a finite determin...
peer reviewedThe nth term of an automatic sequence is the output of a deterministic finite automaton...
International audienceWe study those automatic sequences which are produced by an automaton whose un...
AbstractThe theory of codes and finite automata is applied to prove the existence of codes suitable ...
This work deals mainly with automata theory, mathematical logic and their applications. In the first...
AbstractGiven a finite automaton, its infinite behavior is defined by Büchi (1962), Eilenberg (1974)...
This book is the first integrated treatment of sequences generated by finite automata and their gene...
DOI
Add to ORKG