103 citations · 300 across the 45 of their papers we have counts for
1 paper · 1 filter
Antoine Amarilli, Marc Jeanmougin
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though…