论文信息 - A simplified proof of Parikh's theorem - 字舞流文

A simplified proof of Parikh's theorem

Abstract A strengthened form of the pumping lemma for context-free languages is used to give a simple proof of Parikh's Theorem.

Jonathan Goldstine | Jonathan Goldstine

[1] David S. Wise. A Strong Pumping Lemma for Context-Free Languages , 1976, Theor. Comput. Sci..

[2] Eliahu Shamir,et al. A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables , 1967, Inf. Control..

[3] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[4] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[5] Peter C. Chapin. Formal languages I , 1973, CSC '73.

[6] Seymour Ginsburg,et al. AFL with the Semilinear Property , 1971, J. Comput. Syst. Sci..

[7] Sheila A. Greibach. A generalization of Parikh's semilinear theorem , 1972, Discret. Math..

[8] Jozef Gruska. A Characterization of Context-free Languages , 1971, J. Comput. Syst. Sci..

[9] D. L. Pilling,et al. Commutative Regular Equations and Parikh's Theorem , 1973 .