Quasi-realtime languages

Ronald V. Book; Sheila A. Greibach

doi:10.1007/bf01705890

journal article Mar 01, 1970

Quasi-realtime languages

Ronald V. Book Sheila A. Greibach

Mathematical Systems Theory Vol. 4 No. 1 pp. 97-111 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf01705890

Topics

No keywords indexed for this article. Browse by subject →

References

19

[1]

R. Book, Grammars with time functions, Dissertation, Harvard University, 1969. Also appears as Mathematical Linguistics and Automatic Translation, Report No. NSF-23, The Computation Laboratory, Harvard University, 1969.

[2]

N. Chomsky andM. P. Schützenberger, The algebraic theory of context-free languages,Computer Programming and Formal Systems, North Holland, Amsterdam, 1963.

[3]

J. Evey, The theory and application of pushdown store machines, Dissertation, Harvard University, 1963. Also appears as Mathematical Linguistics and Automatic Translation, Report No. NSF-10, The Computation Laboratory, Harvard University, 1963. 10.1145/1463822.1463848

[4]

M. Fischer, Private communication.

[5]

P. C. Fischer, Turing machines with restricted memory access,Information and Control 9 (1966), 364–379. 10.1016/s0019-9958(66)80003-7

[6]

P. C. Fischer, A. R. Meyer andA. L. Rosenberg, Counter machines and counter languagesMath. Systems Theory 2 (1968), 265–283. 10.1007/bf01694011

[7]

S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

[8]

S. Ginsburg andS. A. Greibach, Abstract families of languages,Mem. Amer. Math. Soc., to appear.

[9]

S. Ginsburg andS. A. Greibach, Multitape abstract families of automata, in preparation.

[10]

S. Ginsburg andS. A. Greibach, Principal AFL, in preparation.

[11]

S. Ginsburg, S. A. Greibach andM. A. Harrison, One-way stack automata,J. Assoc. Comput. Mach. 14 (1967), 389–418. 10.1145/321386.321403

[12]

S. Ginsburg andM. A. Harrison, One-way nondeterministic real-time list-storage languages,J. Assoc. Comput. Mach. 15 (1968), 428–446. 10.1145/321466.321475

[13]

S. A. Greibach, Inverses of phrase structure generators, Dissertation, Harvard University, 1963. Also appears as Mathematical Linguistics and Automatic Translation, Report No. NSF-11, The Computation Laboratory, Harvard University, 1963.

[14]

S. A. Greibach, An infinite hierarchy of context-free languages,J. Assoc. Comput. Mach. 16 (1969), 91–106. 10.1145/321495.321503

[15]

S. A. Greibach andJ. E. Hopcroft, Scattered context grammars,J. Comput. System Sci. 3 (1969), 233–247. 10.1016/s0022-0000(69)80015-2

[16]

J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306. 10.1090/s0002-9947-1965-0170805-7

[17]

J. E. Hopcroft andJ. D. Ullman, An approach to a unified theory of automata,Bell System Tech. J. 46 (1967), 1793–1829. 10.1002/j.1538-7305.1967.tb03172.x

[18]

A. R. Meyer, A. L. Rosenberg andP. C. Fischer, Multitape simulation of multihead Turing machines, IBM Research Report RC 1891, 15 August 1967.

[19]

Real-Time Definable Languages

Arnold L. Rosenberg

Journal of the ACM 1967 10.1145/321420.321423

Metrics

113

Citations

19

References

Details