Journal of the ACM (JACM)
Programming Language for Automata
Journal of the ACM (JACM)
Two-way balloon automata and AFL
Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Formal languages and their relation to automata
Formal languages and their relation to automata
Abstract families of languages
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
A generator of context-sensitive languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Abstract families of processors
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Hi-index | 0.00 |
A ''length-preserving processor'', is in essence a nondeterministic linear bounded automaton with auxiliary storage. Length-preserving processors are partitioned into classes according to their methods of handling storage, and each class is termed an ''abstract family of length-preserving processors'' (AFLP). The smallest AFLP, i.e. the family of linear bounded automata, and the family of context-sensitive languages defined by it are characterized as the smallest families having certain containment and closure properties. These properties motivate the definition of an ''abstract family of length-preserving operations,'' (AFLO), and a ''closed abstract, family of languages'' (closed AFL). Every AFLP computes an AFLO and each of a broad class of storage-bounded subfamilies of an AFLP computes an AFLO or a