Infinite automata are of interest not only in the verification of systems with infinite state spaces, but also as a natural (and so far underdeveloped) framework for the study of formal languages. In this survey, we discuss some basic types of infinite automata, which are based on the so-called prefix-recognizable, synchronized rational, and rational transition graphs, respectively. We present characterizations of these transition graphs (due to Muller/Schupp and to Caucal and students), mention results on their power to recognize languages, and discuss the status of central algorithmic problems (like reachability of given states, or decidability of the first-order theory). © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Thomas, W. (2002). A short introduction to infinite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2295 LNCS, pp. 130–144). Springer Verlag. https://doi.org/10.1007/3-540-46011-x_10
Mendeley helps you to discover research relevant for your work.