Quasi-realtime languages (Extended Abstract)

Authors:
Ronald V. Book;Sheila A. Greibach
Affiliations:
Boston College and Harvard University;Harvard University, Cambridge, Massachusetts
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 6
Cited 1

One-way stack automata

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

Journal of the ACM (JACM)
One-way nondeterministic real-time list-storage languages

Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Scattered context grammars

Journal of Computer and System Sciences

Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quasi-realtime languages are the languages accepted by nondeterministic multitape Turing machines in real time. The family of quasi-realtime languages forms an abstract family of languages closed under intersection, linear erasing, and reversal. It is identical with the family of languages accepted by nondeterministic multitape Turing machines in linear time. Every quasi-realtime language can be accepted in real time by a non-deterministic one stack, one pushdown store machine, and can be expressed as the length-preserving homomorphic image of the intersection of three context-free languages.