Pumping lemmas for term languages
作者：
Highlights：
•
摘要
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.
论文关键词：
论文评审过程：Received 2 May 1975, Revised 15 March 1976, Available online 3 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(78)90012-0
