×

Checking automata and one-way stack languages. (English) Zbl 0174.02702


PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, A. V., Indexed grammars-an extension of context-free grammars, JACM, 15, 647-671 (1968) · Zbl 0175.27801
[2] A. V. Aho; A. V. Aho
[3] Chomsky, N., Context-free grammars and pushdown storage, MIT Res. Lab. Electron. Quart. Prog. Rept., 65 (1962)
[4] Ginsburg, S., (The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill: McGraw-Hill New York) · Zbl 0184.28401
[5] S. Ginsburg and S. GreibachMemoir Am. Math. Soc.; S. Ginsburg and S. GreibachMemoir Am. Math. Soc. · Zbl 0308.68058
[6] Ginsburg, S.; Greibach, S. A.; Harrison, M. A., Stack automata and compiling, JACM, 14, 172-201 (1967) · Zbl 0153.01101
[7] Ginsburg, S.; Greibach, S. A.; Harrison, M. A., One-way stack automata, JACM, 14, 389-418 (1967) · Zbl 0171.14803
[8] S. Ginsburg, S. Greibach and J. Hopcroft.Memoir Am. Math. Soc.; S. Ginsburg, S. Greibach and J. Hopcroft.Memoir Am. Math. Soc.
[9] Greibach, S., Inverses of phrase structure generators, (Doctoral Dissertation (June 1963), Harvard University)
[10] S. Greibach and J. HopcroftMemoir Am. Math. Soc.; S. Greibach and J. HopcroftMemoir Am. Math. Soc.
[11] Hopcroft, J. E.; Ullman, J. D., Deterministic stack automata and the quotient operator, JCSS, 2, 1-12 (1968) · Zbl 0169.31303
[12] M. Schkolnick; M. Schkolnick
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.