The Pumping Lemma for Well-Nested Multiple Context-Free Languages

2009 ◽  
pp. 312-325 ◽  
Author(s):  
Makoto Kanazawa
Keyword(s):  
Multiple Context ◽  
Pumping Lemma ◽  
Context Free

scholarly journals The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

2014 ◽  
Vol 55 (1) ◽  
pp. 250-278 ◽  
Author(s):  
Makoto Kanazawa ◽  
Gregory M. Kobele ◽  
Jens Michaelis ◽  
Sylvain Salvati ◽  
Ryo Yoshinaka
Keyword(s):  
Multiple Context ◽  
Pumping Lemma ◽  
Context Free

scholarly journals Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages

2019 ◽  
Vol 344 ◽  
pp. 151-167
Author(s):  
Marcus V.M. Ramos ◽  
José Carlos Bacelar Almeida ◽  
Nelma Moreira ◽  
Ruy J.G.B. de Queiroz
Keyword(s):  
Pumping Lemma ◽  
Context Free

scholarly journals Second-position clitics and the syntax-phonology interface: The case of ancient Greek

2016 ◽  
Author(s):  
David M. Goldstein ◽  
Dag T. T. Haug
Keyword(s):  
Ancient Greek ◽  
Context Free Grammar ◽  
Multiple Context ◽  
Yield Functions ◽  
Break Up ◽  
Context Free

In this paper we discuss second position clitics in Ancient Greek, which show a remarkable ability to break up syntactic constituents. We argue against attempts to capture such data in terms of a mismatch between c-structure yield and surface string and instead propose to enrich c-structure by using a multiple context free grammar with explicit yield functions rather than an ordinary CFG.

scholarly journals A Pumping Lemma for Permitting Semi-Conditional Languages

2019 ◽  
Vol 30 (01) ◽  
pp. 73-92
Author(s):  
Zsolt Gazdag ◽  
Krisztián Tichler ◽  
Erzsébet Csuhaj-Varjú
Keyword(s):  
Open Problem ◽  
Generative Power ◽  
Context Sensitive ◽  
Sentential Form ◽  
Pumping Lemma ◽  
Context Free ◽  
Context Free Grammars

Permitting semi-conditional grammars (pSCGs) are extensions of context-free grammars where each rule is associated with a word [Formula: see text] and such a rule can be applied to a sentential form [Formula: see text] only if [Formula: see text] is a subword of [Formula: see text]. We consider permitting generalized SCGs (pgSCGs) where each rule [Formula: see text] is associated with a set of words [Formula: see text] and [Formula: see text] is applicable only if every word in [Formula: see text] occurs in [Formula: see text]. We investigate the generative power of pgSCGs with no erasing rules and prove a pumping lemma for their languages. Using this lemma we show that pgSCGs are strictly weaker than context-sensitive grammars. This solves a long-lasting open problem concerning the generative power of pSCGs. Moreover, we give a comparison of the generating power of pgSCGs and that of forbidding random context grammars with no erasing rules.

scholarly journals Groups whose word problems are not semilinear

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Robert H. Gilman ◽  
Robert P. Kropholler ◽  
Saul Schleimer
Keyword(s):  
Fundamental Group ◽  
Nilpotent Group ◽  
Finite Volume ◽  
Formal Language ◽  
Artin Group ◽  
Infinite Class ◽  
Context Free Language ◽  
Multiple Context ◽  
Context Free ◽  
Free Language

Abstract Suppose that G is a finitely generated group and {\operatorname{WP}(G)} is the formal language of words defining the identity in G. We prove that if G is a virtually nilpotent group that is not virtually abelian, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group whose graph lies in a certain infinite class, then {\operatorname{WP}(G)} is not a multiple context-free language.

Sign in / Sign up

Export Citation Format

Share Document