Minimal nontrivial space complexity of probabilistic one-way turing machines
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Automaticity: Properties of a Measure of Descriptional Complexity
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Modularization of regular growth automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
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.