Abstract numeration systems

Authors:
Narad Rampersad
Affiliations:
Institute of Mathematics, University of Liège, Liège, Belgium
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 12
Cited 0

Rational series and their languages

Rational series and their languages
Numeration systems, linear recurrences, and regular sets

Information and Computation
On factors of automatic words

Theoretical Computer Science
Bertrand numeration systems and recognizability

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Generalization of automatic sequences for numeration systems on a regular language

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
More on generalized automatic sequences

Journal of Automata, Languages and Combinatorics
The definable criterion for definability in Presburger arithmetic and its applications

Theoretical Computer Science
Real numbers having ultimately periodic representations in abstract numeration systems

Information and Computation
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Decimations of languages and state complexity

Theoretical Computer Science
Periodicity, repetitions, and orbits of an automatic sequence

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey various results concerning abstract numeration systems. We begin with the classical case of the integer base numeration systems, then examine the more general case of linear numeration systems. Finally we discuss abstract numeration systems, which generalize even further the two previous classes of numeration systems.