Skip to search formSkip to main contentSkip to account menu

Pumping lemma for context-free languages

Known as: The bar-hilel lemma, The bar hilel lemma, Pumping lemma (context-free languages) 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The goal of KATRIN is to measure the absolute mass of the electron-antineutrino with a sensitivity of 200 meV by analyzing the… 
2012
2012
  • P. Parys
  • 2012
  • Corpus ID: 15189918
We show that deterministic collapsible pushdown automata of second level can recognize a language which is not recognizable by… 
2010
2010
The concept of attributed tree transducer is a formal model for studying properties of attribute grammars(cid:2) In this paper… 
2008
2008
The numerical simulation based on the solution to the generalized nonlinear Schrödinger equation is used to analyze various… 
2007
2007
We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between… 
2006
2006
Mesospheric sodium guidestar radiance is plotted vs. wavelength, fasor power, fasor polarization and date. Peak radiance for… 
2003
2003
We propose here a (biologically inspired) model of P system called proton pumping P system that is a special case of evolution… 
Review
2002
Review
2002
T�e su tainabl� d�veJop�ent of any region depends on the avai labi l ity of water resources. In and ar:d sem � -and regI Ons, �he… 
Review
1997
Review
1997
A thorough analysis of hydrologic pumping tests requires the knowledge about the flow regimes in order to employ the right… 
Highly Cited
1986
Highly Cited
1986
One of the most striking features of the upper North Atlantic Ocean is an extensive layer of water with temperature close to 18°C…