A generalization of automatic sequences
Theoretical Computer Science
The ring of k-regular sequences
Theoretical Computer Science
Languages and machines: an introduction to the theory of computer science
Languages and machines: an introduction to the theory of computer science
Theoretical Computer Science
Generalization of automatic sequences for numeration systems on a regular language
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
About frequencies of letters in generalized automatic sequences
Theoretical Computer Science
Extensions and restrictions of Wythoff's game preserving its P positions
Journal of Combinatorial Theory Series A
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
| Hi-index | 0.00 |
We give some generalizations of k-automatic sequences replacing the k-ary system by an abstract numeration system on a regular language. We study some of the closure properties of these sequences and the possible extension to the multidimensional case or to infinite alphabets. The equivalence of these sequences and morphic predicates is given and the relationship to recognizability is also investigated.