The Pumping Lemma for Context-Free Languages is Undecidable.

Hermann Gruber Markus Holzer Christian Rauch

Published in: DLT (2024)

Keyphrases

context free languages
context free grammars
grammatical inference
context free
regular languages
sufficient conditions
inductive inference
context sensitive
regular expressions
lower bound
data model
state space
natural language processing
decision problems
finite state
positive data