Büchi automata recognizing sets of reals definable in first-order logic with addition and order
Arthur Milchior · arXiv (Cornell University) · 2016
This work considers weak deterministic Büchi automata reading encodings of non-negative reals in a fixed base. A Real Number Automaton is an automaton which recognizes all encoding of elements of a set of reals. It is explained how to decide in linear time whether a set of reals recognized by a given minimal weak deterministic RNA is ${FO}[\mathbb R;+,