Families of DFAs as Acceptors of $ω$-Regular Languages.
Dana AngluinUdi BokerDana FismanPublished in: CoRR (2016)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- finite automata
- context free languages
- decision problems
- context free grammars
- pac learning
- positive data
- query language
- finite state machines
- xml schema
- knowledge representation
- training data
- database systems
- statistical queries
- context free
- equivalence queries
- active learning