Real-Time Definable Languages

Authors:
Arnold L. Rosenberg
Affiliations:
IBM Watson Research Center, Yorktown Heights, New York
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 2
Cited 16

Quotients of Context-Free Languages

Journal of the ACM (JACM)
Ambiguity in context free languages

Journal of the ACM (JACM)

One-way nondeterministic real-time list-storage languages

Journal of the ACM (JACM)
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages

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

Journal of the ACM (JACM)
Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)
Deterministic Turing machines in the range between real-time and linear-time

Theoretical Computer Science
Characterization of real time iterative array by alternating device

Theoretical Computer Science
Refining nondeterminism below linear time

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Computations with a restricted number of nondeterministic steps (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
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
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

STOC '70 Proceedings of the second 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
Theory of computing in computer science education

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Time-restricted sequence generation

Journal of Computer and System Sciences
On the extension of Gladkij's Theorem and the Hierarchies of languages

Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Time-bounded grammars and their languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

The closure properties of the class of languages defined by real-time, online, multi-tape Turing machines are proved. The results obtained are, for the most part, negative and, as one would expect, asymmetric. It is shown that the results remain valid for a broad class of real-time devices. Finally, the position of the class of real-time definable languages in the “classical” linguistic hierarchy is established.