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)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Marcus VinÃcius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, JosÃ© Bacelar Almeida
- J. Formalized Reasoning
- 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

- Alexey Sorokin
- Developments in Language Theory
- 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

- Antoine Amarilli, Marc Jeanmougin
- ArXiv
- 2012

The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-knownâ€¦Â (More)

Is this relevant?

Review

2008

Review

2008

- Tomoyuki Yamakami
- ArXiv
- 2008

Chomsky studied regular languages and context-free languages to develop his theory of formal languages. These languages areâ€¦Â (More)

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)

Is this relevant?

1996

1996

- Armin KÃ¼hnemann
- CAAP
- 1996

The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functionalâ€¦Â (More)

Is this relevant?

1994

1994

- Armin KÃ¼hnemann, Heiko Vogler
- Acta Cybern.
- 1994

The concept of attributed tree transducer is a formal model for studying properties of attribute grammars In this paper forâ€¦Â (More)

Is this relevant?

1993

1993

- Don Colton
- SIGA
- 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

- Yoshihide Igarashi
- Theor. Comput. Sci.
- 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

- Jeffrey M. Jaffe
- SIGA
- 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?