×

zbMATH — the first resource for mathematics

Principal AFL. (English) Zbl 0198.03102

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho, A.V., Nested stack automata, J. assoc. comput. Mach., 19, 383-406, (1969) · Zbl 0184.28603
[2] Chomsky, N., On certain formal properties of grammars, Information and control, 2, 137-167, (1959) · Zbl 0088.10801
[3] Chomsky, N., Context-free grammars and pushdown storage, MIT research laboratory of electronics, quarterly progress report, 65, 187-194, (1962)
[4] Ginsburg, S.; Greibach, S.A., “abstract families of languages,” studies in abstract families of languages, Mem. amer. math. soc., memoir, 87, 41-51, (1969) · Zbl 0194.31402
[5] Ginsburg, S.; Spanier, E.H., Finite-turn pushdown automata, SIAM J. of control, 4, 429-453, (1966) · Zbl 0147.25302
[6] Ginsburg, S.; Spanier, E.H., Substitution in families of languages, Information sciences, 2, 83-110, (1970) · Zbl 0211.31401
[7] Greibach, S.A., A new normal-form theorem for context-free phrase structure grammars, Journal of the association for computing machinery, 12, 42-52, (1965) · Zbl 0135.18404
[8] Greibach, S.A., An infinite hierarchy of context-free grammars, J. assoc. comput. Mach., 16, 91-106, (1969) · Zbl 0182.02002
[9] Greibach, S.A., Checking automata and one-way stack languages, J. comput. system sci., 3, 196-217, (1969) · Zbl 0174.02702
[10] Greibach, S.A.; Ginsburg, S., Multitape AFA, SDC document TM-738/051/00, (January 1969)
[11] Greibach, S.A.; Hopcroft, J., “independence of AFL operations,” studies in abstract families of languages, Mem. amer. math. soc. memoir, 87, 33-40, (1969)
[12] Stearns, R.E.; Hartmanis, J.; Lewis, P.M., Hierarchies of memory limited computations, (), 179-190 · Zbl 0229.02033
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.