Article (Scientific journals)
Numerations systems on a regular language
Lecomte, Pierre; Rigo, Michel
2001In Theory of Computing Systems, 34, p. 27-44
Peer Reviewed verified by ORBi
 

Files


Full Text
TOCS902-main.pdf
Author preprint (261.61 kB)
Request a copy

The original publication is available at www.springerlink.com


All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
numeration system; recognizable sets of integers; multiplication by a constant
Abstract :
[en] 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 translation and multiplication by constants as well as the order-dependence of the recognizability.
Disciplines :
Computer science
Mathematics
Author, co-author :
Lecomte, Pierre ;  Université de Liège - ULiège > Département de mathématique > Géométrie et théorie des algorithmes
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Numerations systems on a regular language
Publication date :
2001
Journal title :
Theory of Computing Systems
ISSN :
1432-4350
eISSN :
1433-0490
Publisher :
Springer Science & Business Media B.V., New York, United States - New York
Volume :
34
Pages :
27-44
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 01 July 2009

Statistics


Number of views
69 (4 by ULiège)
Number of downloads
1 (0 by ULiège)

Scopus citations®
 
52
Scopus citations®
without self-citations
23
OpenCitations
 
38

Bibliography


Similar publications



Contact ORBi