Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 1 / 4H / a

Table of contents
- Solution a

Solution

The pumping lemma for context-free languages states that for every context-free language

L

there is a pumping length

p

such that every

w \in L

with

∣ w ∣ \geq p

can be written

w = uvx yz

with

∣ vx y ∣ \leq p, ∣ v y ∣ > 0, u v^{i} x y^{i} z \in L for every i \geq 0.

 Ancestors (10)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version