×

Pumping lemmas for term languages. (English) Zbl 0388.68071


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Goguen, J.A.; Thatcher, J.W.; Wagner, E.G.; Wright, J.B., Initial algebra semantics and continuous algebras, J. assoc. comput. Mach., 24, 68-95, (1977) · Zbl 0359.68018
[2] Aho, A.V., Indexed grammars—an extension of context free grammars, J. assoc. comput. Mach., 15, 647-671, (1968) · Zbl 0175.27801
[3] Bar-Hillel, Y.; Perles, M.; Shamir, E., On formal properties of simple phrase structure grammars, Z. phonetik sprachwiss. kommunikat., 14, 143-172, (1961) · Zbl 0106.34501
[4] Brainerd, W.E., Tree generating regular systems, Inform. contr., 14, 217-231, (1969) · Zbl 0169.31601
[5] Hayashi, T., On derivation trees of indexed grammars, Publ. RIMS Kyoto univ., 9, 61-92, (1973) · Zbl 0319.68043
[6] Maibaum, T.S.E., A generalized approach to formal languages, J. comput. syst. sci., 8, 409-439, (1974) · Zbl 0361.68113
[7] {\scT.S.E. Maibaum and J. Opatrný}, Generalised indexed grammars and indexed term grammars, in preparation.
[8] Moore, E.F., Gedanken experiments on sequential machines, (), 129-153
[9] Ogden, W.F., Intercalation theorems for stack automata, () · Zbl 1282.68156
[10] Rounds, W.C., Tree-oriented proofs of some theorems on context-free and indexed languages, () · Zbl 0203.30103
[11] Thatcher, J.W., Generalized^{2} sequential machines, J. comput. syst. sci., 4, 339-367, (1970) · Zbl 0198.03303
[12] {\scJ.W. Thatcher}, Private communication, 1972.
[13] Thatcher, J.W.; Wright, J.B., Generalized finite automata theory with an application to a decision problem of second-order logic, Math. syst. theory, 2, 57-81, (1968) · Zbl 0157.02201
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.