Families of DFAs as Acceptors of omega-Regular Languages.
Dana AngluinUdi BokerDana FismanPublished in: MFCS (2016)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- finite state machines
- hidden markov models
- context free
- database
- statistical queries
- computational complexity
- xml schema
- data management
- np hard
- equivalence queries
- lower bound