Numeration Systems on a Regular Language

Generalizations of positional number systems in which N is recognizable by finite automata are obtained by describing an arbitrary infinite regular language according to the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2000-02, Vol.34 (1), p.27-44
Hauptverfasser:	Lecomte, P. B. A., Rigo, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Automation Computation Constants Mathematical analysis Multiplication Order disorder Recognition Translations
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!