Journal article
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.
Authors
Maibaum TSE
Journal
Journal of Computer and System Sciences, Vol. 17, No. 3, pp. 319–330
Publisher
Elsevier
Publication Date
12 1978
DOI
10.1016/0022-0000(78)90012-0
ISSN
0022-0000