Generalized finite automata over real and complex numbers
نویسندگان
چکیده
منابع مشابه
Generalized Finite Automata over Real and Complex Numbers
In a recent work, Gandhi, Khoussainov, and Liu [7] introduced and studied a generalized model of finite automata able to work over arbitrary structures. As one relevant area of research for this model the authors identify studying such automata over partciular structures such as real and algebraically closed fields. In this paper we start investigations into this direction. We prove several str...
متن کاملNormal numbers and finite automata
We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input-output behaviour is injective; they are also known as injective finite-state transdu...
متن کاملDiophantine properties of real numbers generated by finite automata
We study some Diophantine properties of automatic real numbers and we present a method to derive irrationality measures for such numbers. As a consequence, we prove that the b-adic expansion of a Liouville number cannot be generated by a finite automaton, a conjecture due to Shallit.
متن کاملA Generalization of Cobham's Theorem to Automata over Real Numbers
This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables 〈R, Z,+, <〉 can all be recognized by weak deterministic Büchi automata, regardless of the encoding base r > 1. In this paper, we prove the reciprocal property, i.e., t...
متن کاملA Generalization of Semenov's Theorem to Automata over Real Numbers
This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are used, in particular, as symbolic data structures for representing sets definable in the first-order theory 〈R, Z,+,≤〉, i.e., the mixed additive arithmetic of integer and real variables. They also lead to a simple decision proced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.001