11 citations · 13 across the 6 of their papers we have counts for
Showing 1999 · cs.CCShow all
3 papers · 2 filters
cs.CC1999
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…
cs.CC1999
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…
cs.CC1999
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…