AbstractThere exist various well-known characterizations of sets of numbers recognizable by a finite automaton, when they are represented in some integer base p⩾2. We show how to modify these characterizations, when integer bases p are replaced by linear numeration systems whose characteristic polynomial is the minimal polynomial of a Pisot number. We also prove some related interesting properties
peer reviewedLet k >= 2 be an integer. A set X of integers is k-recognizable if the language of k-ar...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
AbstractThere exist various well-known characterizations of sets of numbers recognizable by a finite...
peer reviewedWe study the structure of automata accepting the greedy representations of N in a wide ...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
peer reviewedA set of integers is $S$-recognizable in an abstract numeration system $S$ if the langu...
peer reviewedA set of integers is $S$-recognizable in an abstract numeration system $S$ if the langu...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
peer reviewedLet k >= 2 be an integer. A set X of integers is k-recognizable if the language of k-ar...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
AbstractThere exist various well-known characterizations of sets of numbers recognizable by a finite...
peer reviewedWe study the structure of automata accepting the greedy representations of N in a wide ...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
peer reviewedA set of integers is $S$-recognizable in an abstract numeration system $S$ if the langu...
peer reviewedA set of integers is $S$-recognizable in an abstract numeration system $S$ if the langu...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
peer reviewedLet k >= 2 be an integer. A set X of integers is k-recognizable if the language of k-ar...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
DOI
Add to ORKG