论文信息 - Pumping Lemmas for Term Languages - 字舞流文

Pumping Lemmas for Term Languages

Abstract Pumping lemmas are stated and proved for the classes of regular and context-free sets of terms. The lemmas are then applied to solve decision problems concerning these classes of sets.

T. S. E. Maibaum | T. Maibaum

[1] James W. Thatcher,et al. Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[2] William C. Rounds,et al. Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.

[3] Walter S. Brainerd,et al. Tree Generating Regular Systems , 1969, Inf. Control..

[4] Takeshi Hayashi. On Derivation Trees of Indexed Grammars —An Extension of the uvwxy-Theorem— , 1973 .

[5] Joseph A. Goguen,et al. Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[6] T. S. E. Maibaum,et al. A Generalized Approach to Formal Languages , 1974, J. Comput. Syst. Sci..

[7] Alfred V. Aho,et al. Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[8] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .