Towards a characterization of the star-free sets of integers

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, 4 figures

Scientific paper

Let U be a numeration system, a set X of integers is U-star-free if the set made up of the U-representations of the elements in X is a star-free regular language. Answering a question of A. de Luca and A. Restivo, we obtain a complete logical characterization of the U-star-free sets of integers for suitable numeration systems related to a Pisot number and in particular for integer base systems. For these latter systems, we study as well the problem of the base dependence. Finally, the case of k-adic systems is also investigated.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Towards a characterization of the star-free sets of integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards a characterization of the star-free sets of integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards a characterization of the star-free sets of integers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-458471

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.