Introducing Second-Order Spider Diagrams for Defining Regular Languages.
Peter ChapmanGem StapletonPublished in: VL/HCC (2010)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- positive data
- context free grammars
- pac learning
- context free
- inductive inference
- finite state machines
- pattern matching
- lower bound
- positive and negative
- statistical queries
- noisy data
- upper bound
- knowledge representation
- dynamic programming