A pumping theorem for regular languages.
Donald F. StanatStephen F. WeissPublished in: SIGACT News (1982)
Keyphrases
- regular languages
- grammatical inference
- context free languages
- regular expressions
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- context free
- finite state machines
- pattern matching
- statistical queries
- inductive inference
- query language
- database
- learning tasks
- xml data
- relational databases