Article (Scientific journals)
Characterizing Simpler recognizable sets of integers
Rigo, Michel
2004In Studia Logica, 76, p. 407-426
Peer reviewed
 

Files


Full Text
sf.pdf
Author preprint (292.85 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Star-free languages; recognizable sets of integers; numeration systems; Logical characterizations
Abstract :
[en] For a given numeration system U, a set X of integers is said to be U-star-free if the language of the normalized U-representations of the elements in X is star-free. Adapting a result of McNaughton and Papert, we give a first-order logical characterization of these sets for various numeration systems including integer base systems and the Fibonacci system. For k-ary systems, the problem of the base dependence of this property is also studied. Finally, the case of k-adic systems is developed.
Disciplines :
Mathematics
Computer science
Author, co-author :
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Characterizing Simpler recognizable sets of integers
Publication date :
2004
Journal title :
Studia Logica
ISSN :
0039-3215
eISSN :
1572-8730
Publisher :
Kluwer Academic Publishers, Netherlands
Volume :
76
Pages :
407-426
Peer reviewed :
Peer reviewed
Available on ORBi :
since 01 July 2009

Statistics


Number of views
30 (0 by ULiège)
Number of downloads
0 (0 by ULiège)

Bibliography


Similar publications



Contact ORBi