Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017
A Quasi-Linear Time Algorithm Deciding Whether Weak Büchi Automata Reading Vectors of Reals Recognize Saturated Languages
Arthur Milchior
This work considers weak deterministic Büchi automata reading encodings of non-negative -vectors of reals in a fixed base. A saturated language is a language which contains all…
cs.FL2016
Büchi automata recognizing sets of reals definable in first-order logic with addition and order
Arthur Milchior
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…