Numeration systems on a regular language: Arithmetic operations, Recognizability and Formal power series

What this record says

Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered

CATALOG · The abstract is indexed.