论文信息 - Quasi-realtime languages

Quasi-realtime languages

The quasi-realtime languages are seen to be 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 nondeterministic one stack, one pushdown store machine, and can be expressed as the length-preserving homomorphic image of the intersection of three context-free languages.

Sheila A. Greibach | Ronald V. Book | R. V. Book | S. Greibach

[1] R. James Evey,et al. Application of pushdown-store machines , 1899, AFIPS '63 (Fall).

[2] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..

[3] Arnold L. Rosenberg,et al. Counter machines and counter languages , 1968, Mathematical systems theory.

[4] Patrick C. Fischer,et al. Turing Machines with Restricted Memory Access , 1966, Inf. Control..

[5] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .

[6] Arnold L. Rosenberg,et al. Real-Time Definable Languages , 1967, JACM.

[7] John E. Hopcroft,et al. Scattered Context Grammars , 1969, J. Comput. Syst. Sci..

[8] J. Hopcroft,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.

[9] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

[10] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.

[11] Jeffrey D. Ullman,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.

[12] Seymour Ginsburg,et al. One-way nondeterministic real-time list-storage languages , 1968, JACM.

[13] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[14] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[15] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .