Chains of full AFL’s. (English) Zbl 0203.30102

Full Text: DOI


[1] A. V. Aho, Indexed grammars–an extension of context free grammars,J. Assoc. Comput. Mach. 15 (1968), 647–671. · Zbl 0175.27801
[2] N. Chomsky andM. P. Schützenberger, The algebraic theory of context free languages,Computer Programing and Formal Systems, P. Braffort and D. Hirschberg (eds.), North Holland Publishing Co., Amsterdam, 1963, pp. 118–161.
[3] S. Ginsburg andS. Greibach, Abstract families of languages,Studies in Abstract Families of Languages, Memoirs of the American Mathematical Society, No. 87, Providence, Rhode Island (1969), 1–32. · Zbl 0194.31402
[4] S. Ginsburg andS. Greibach, Principal AFL, SDC Document No. TM-738/051/01, 1969,J. Comput. System Sci., to appear.
[5] S. Ginsburg andE. Spanier, Derivation-bounded languages,J. Comput. System Sci. 2 (1968), 228–250. · Zbl 0176.16703
[6] S. Ginsburg andE. Spanier, Substitutions in families of languages,Information Sciences, to appear. · Zbl 0211.31401
[7] S. Greibach, An infinite hierarchy of context-free languages,J. Assoc. Comput. Mach. 16 (1969), 91–106. · Zbl 0182.02002
[8] S. Greibach, Checking automata and one-way stack languages,J. Comput. Systems Sci. 1 (1968), 196–217. · Zbl 0174.02702
[9] S. Greibach, Full AFL’s and nested iterated substitution,Information and Control 16 (1970), 7–35. · Zbl 0188.03102
[10] S. Greibach andS. Ginsburg, Multitape AFA, SDC Document TM-738/050/00, 2 January 1969.
[11] S. Greibach andJ. Hopcroft, Independence of AFL Operations,Studies in Abstract Families of Languages, by Greibach, Ginsburg and Hopcroft, Memoirs of the American Mathematical Society, No. 87, Providence, Rhode Island, (1969), 33–40. · Zbl 0194.31402
[12] 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
[13] M. Nivat, Transductions des langages de Chomsky, Dissertation, Grenoble University, 1967.
[14] M. Schkolnick, Two-type bracked grammars,IEEE Ninth Annual Symposium on Switching and Automata Theory, October 1968, pp. 315–326.
[15] M. K. Yntema, Inclusion relations among families of context-free languages,Information and Control 10 (1967), 572–597. · Zbl 0207.31405
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.