Login / Signup
A necessary and sufficient pumping lemma for regular languages.
Jeffrey M. Jaffe
Published in:
SIGACT News (1978)
Keyphrases
</>
regular languages
context free languages
grammatical inference
regular expressions
finite automata
decision problems
context free grammars
pac learning
positive data
finite state machines
context free
database systems
pattern matching
equivalence queries