One-way nondeterministic real-time list-storage languages

Authors:
Seymour Ginsburg;Michael A. Harrison
Affiliations:
System Development Corporation, Santa Monica, California;University of California, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 7
Cited 8

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Stack automata and compiling

Journal of the ACM (JACM)
One-way stack automata

Journal of the ACM (JACM)
Real-Time Definable Languages

Journal of the ACM (JACM)
A formal semantics for computer languages and its application in a compiler-compiler

Communications of the ACM
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Nested Stack Automata

Journal of the ACM (JACM)
Multitape AFA

Journal of the ACM (JACM)
Canonical Precedence Schemes

Journal of the ACM (JACM)
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition—(Extended Abstract)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Quasi-realtime languages (Extended Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
A system for designing fast programming language translators

AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
On the extension of Gladkij's Theorem and the Hierarchies of languages

Journal of Computer and System Sciences
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time

CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A device is presented which has its memory organized as a linear list, a type of storage equivalent to having two pushdown stores. Attention is then focused on the nondeterministic automaton (called an lsa) which results when the input is read one-way and the device operates in real-time. The set of words (called a language) accepted by an lsa is extensively studied. In particular, several characterizations and closure properties of languages are given.