×

zbMATH — the first resource for mathematics

Quasi-real-time languages. (English) Zbl 0188.33102

PDF BibTeX XML Cite
Full Text: DOI
References:
[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. · Zbl 0148.00804
[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. · Zbl 0196.52501
[4] M. Fischer, Private communication.
[5] P. C. Fischer, Turing machines with restricted memory access,Information and Control 9 (1966), 364–379. · Zbl 0145.24205 · doi: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. · Zbl 0165.32002 · doi:10.1007/BF01694011
[7] S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. · Zbl 0184.28401
[8] S. Ginsburg andS. A. Greibach, Abstract families of languages,Mem. Amer. Math. Soc., to appear. · Zbl 0308.68058
[9] S. Ginsburg andS. A. Greibach, Multitape abstract families of automata, in preparation.
[10] S. Ginsburg andS. A. Greibach, Principal AFL, in preparation. · Zbl 0308.68059
[11] S. Ginsburg, S. A. Greibach andM. A. Harrison, One-way stack automata,J. Assoc. Comput. Mach. 14 (1967), 389–418. · Zbl 0171.14803
[12] S. Ginsburg andM. A. Harrison, One-way nondeterministic real-time list-storage languages,J. Assoc. Comput. Mach. 15 (1968), 428–446. · Zbl 0207.01603
[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. · Zbl 0182.02002
[15] S. A. Greibach andJ. E. Hopcroft, Scattered context grammars,J. Comput. System Sci. 3 (1969), 233–247. · Zbl 0174.02801 · doi: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. · Zbl 0131.15404 · doi: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. · Zbl 0155.34303
[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] A. L. Rosenberg, Real-time definable languages,J. Assoc. Comput. Mach. 14 (1967), 645–662. · Zbl 0153.00902
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.