论文信息 - A Pumping Lemma for Permitting Semi-Conditional Languages - 字舞流文

A Pumping Lemma for Permitting Semi-Conditional Languages

Permitting semi-conditional grammars (pSCGs) are extensions of context-free grammars where each rule is associated with a word w and such a rule can be applied to a sentential form u only if w is a...

Erzsébet Csuhaj-Varjú | Zsolt Gazdag | Krisztián Tichler | E. Csuhaj-Varjú | Zsolt Gazdag | Krisztián Tichler

[1] Jürgen Dassow,et al. On restricted context-free grammars , 2012, J. Comput. Syst. Sci..

[2] Zsolt Gazdag. Remarks on some Simple Variants of Random Context Grammars , 2014, J. Autom. Lang. Comb..

[3] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[5] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[6] Tomás Masopust. Simple restriction in context-free rewriting , 2010, J. Comput. Syst. Sci..

[7] Gheorghe Paun. A Variant of Random Context Grammars: Semi-Conditional Grammars , 1985, Theor. Comput. Sci..

[8] Ivan Fris,et al. Grammars with Partial Ordering of the Rules , 1968, Inf. Control..

[9] Sigrid Ewert,et al. A shrinking lemma for random forbidding context languages , 2000, Theor. Comput. Sci..

[10] Sigrid Ewert,et al. A pumping lemma for random permitting context languages , 2002, Theor. Comput. Sci..

[11] Gheorghe Paun,et al. On the Generative Capacity of Conditional Grammars , 1979, Inf. Control..