4 papers · 1 filter
Numeration systems on a regular language: Arithmetic operations, Recognizability and Formal power series
Michel Rigo
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a fin…
Construction of regular languages and recognizability of polynomials
Michel Rigo
A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinit…
Generalization of automatic sequences for numeration systems on a regular language
Michel Rigo
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically w…
Numeration systems on a regular language
Pierre B. A. Lecomte, Michel Rigo
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular languag…