On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

10.2168/LMCS-6(1:6)2010

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.

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

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases 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 On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-568582

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