We present a class of infinite automata, in which all local computations are performed by finite state machines. These automata characterize an abstract family of languages which does not seem to coincide with any other known class, and which seems to cut across the Chomsky hierarchy. We show results regarding recognizing power and closure properties, and sketch the use of machine growth as a refined measure of complexity with respect to some well-known measures. © 2011 Springer-Verlag.
CITATION STYLE
Wurm, C. (2011). Regular growth automata: Properties of a class of finitely induced infinite machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6878 LNAI, pp. 192–208). https://doi.org/10.1007/978-3-642-23211-4_12
Mendeley helps you to discover research relevant for your work.