@article{MEER201585,
    Abstract = {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 particular structures such as real and algebraically closed fields. In this paper we start investigations into this direction. We prove several structural results about sets accepted by such automata, and analyze decidability as well as complexity of several classical questions about automata in the new framework. Our results show quite a diverse picture when compared to the well known results for finite automata over finite alphabets.},
    Author = {Meer, Klaus and Naif, Ameen},
    File = {Generalized finite automata over real and complex numbers - 1-s2.0-S0304397515003928-main - a - r.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Generalized finite automata, Real and complex number computations, Decision problems for automata over uncountable structures},
    Pages = {85 - 98},
    Title = {Generalized finite automata over real and complex numbers},
    URL = {http://www.sciencedirect.com/science/article/pii/S0304397515003928},
    Volume = {591},
    Year = {2015},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397515003928},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2015.05.001},
    date-added = {2020-10-30 14:01:21 +0100},
    date-modified = {2020-10-30 14:01:21 +0100},
    doi = {10.1016/j.tcs.2015.05.001}
}

@article{MEER201585, Abstract = {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 particular structures such as real and algebraically closed fields. In this paper we start investigations into this direction. We prove several structural results about sets accepted by such automata, and analyze decidability as well as complexity of several classical questions about automata in the new framework. Our results show quite a diverse picture when compared to the well known results for finite automata over finite alphabets.}, Author = {Meer, Klaus and Naif, Ameen}, File = {Generalized finite automata over real and complex numbers - 1-s2.0-S0304397515003928-main - a - r.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Generalized finite automata, Real and complex number computations, Decision problems for automata over uncountable structures}, Pages = {85 - 98}, Title = {Generalized finite automata over real and complex numbers}, URL = {http://www.sciencedirect.com/science/article/pii/S0304397515003928}, Volume = {591}, Year = {2015}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397515003928}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2015.05.001}, date-added = {2020-10-30 14:01:21 +0100}, date-modified = {2020-10-30 14:01:21 +0100}, doi = {10.1016/j.tcs.2015.05.001} }