Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
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.
KeywordsRegular Language Closure Property Letter Operator Garden Path Automatic Structure
Unable to display preview. Download preview PDF.
- 3.Hawkins, J.A.: A Performance Theory of Order and Constituency. Cambridge Univ. Pr., Cambridge (1994)Google Scholar
- 6.Kornai, A.: Natural languages and the chomsky hierarchy. In: Proceedings of the 2nd European Conference of the ACL 1985, pp. 1–7 (1985)Google Scholar
- 7.MacNaughton, R., Papert, S.: Counter-free Automata. M.I.T. Press, Cambridge (1971)Google Scholar
- 8.Marcus, M., Hindle, D., Fleck, M.: D-Theory: Talking about talking about trees. In: Proceedings of the 21st Annual Meeting of the ACL 1983, pp. 129–136 (1983)Google Scholar
- 11.Stabler, E.P.: The finite connectivity of linguistic structure. In: Clifton, C., Frazier, L., Rayner, K. (eds.) Perspectives on Sentence Processing, pp. 303–336. Lawrence Erlbaum, Mahwah (1994)Google Scholar
- 12.Trakhtenbrodt, B.A., Barzdin, Y.M.: Finite Automata. North Holland, Amsterdam (1973)Google Scholar