×

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


PDF BibTeX XML Cite
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] {\scA. V. Aho}. Nested stack automata. Submitted for publication.
[3] Chomsky, N., Context-free grammars and pushdown storage, MIT res. lab. electron. quart. prog. rept., 65, (1962)
[4] Ginsburg, S., ()
[5] {\scS. Ginsburg and S. Greibach}. Abstract families of languages. To appear in Memoir 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] {\scS. Ginsburg, S. Greibach and J. Hopcroft.} Pre-AFL. Memoir Am. Math. Soc. To appear.
[9] Greibach, S., Inverses of phrase structure generators, ()
[10] {\scS. Greibach and J. Hopcroft}. Independence of AFL operations. To appear in Memoir 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] {\scM. Schkolnick}. Two-type bracketed grammars. IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, Schenectady, New York, pp. 315-326.
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.