论文信息 - On context-free and Szilard languages - 字舞流文

On context-free and Szilard languages

Szilard languages of context-free grammars are studied. Especially, classical pumping, generalized pumping, Sokolowski's criterion, and semilinearity are considered as possible distinguishing properties between context-free and Szilard languages.

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

[2] Arnaldo Moura,et al. A Generalization of Ogden's Lemma , 1982, JACM.

[3] Anton Nijholt. A Note on the Sufficiency of Sokolowski's Criterion for Context-Free Languages , 1982, Inf. Process. Lett..

[4] Etsuro Moriya,et al. Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..

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

[6] Stefan SOKOLOWSKI. A Method for Proving Programming Languages non Context-Free , 1978, Inf. Process. Lett..

[7] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[8] Sándor Horváth,et al. The family of languages satisfying "Bar-Hillel's" lemma , 1978, RAIRO Theor. Informatics Appl..