Pumping lemma for context-free languages

Known as: The bar-hilel lemma, The bar hilel lemma, Pumping lemma 
In computer science, in particular in formal language theory, the pumping lemma for context-free languages, also known as the Bar-Hillel lemma, is a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2016
0519772016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language… (More)
Is this relevant?
2014
2014
The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008… (More)
Is this relevant?
2012
2012
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known… (More)
  • figure 1
Is this relevant?
Review
2008
Review
2008
Chomsky studied regular languages and context-free languages to develop his theory of formal languages. These languages are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In formal language theory, one of the most fundamental tools, known as pumping lemmas, is extremely useful for regular and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1996
1996
The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functional… (More)
  • figure 12
Is this relevant?
1994
1994
The concept of attributed tree transducer is a formal model for studying properties of attribute grammars In this paper for… (More)
  • figure I
Is this relevant?
1993
1993
The Pumping Lemma for context-free languages is a popular tool for proving that languages are not context-free. It claims that… (More)
Is this relevant?
1985
1985
We establish a pumping lemma for real-time deterministic context-free languages. The pumping lemma is useful to prove that a… (More)
Is this relevant?
1978
1978
1. Introductio n A well known necessary and sufficient condition to guarantee that a language is regular i s provided by Neroce… (More)
Is this relevant?