Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
Volker DiekertSteffen KopeckiVictor MitranaPublished in: CoRR (2011)
Keyphrases
- regular languages
- finite automata
- positive data
- equivalence queries
- grammatical inference
- context free languages
- regular expressions
- statistical queries
- decision problems
- membership queries
- context free grammars
- positive and negative
- pac learning
- special case
- lower bound
- hidden markov models
- efficient learning
- context free
- pattern languages
- uniform distribution
- computational complexity
- semi supervised learning
- decision trees
- databases
- pac learnable
- pattern matching
- worst case
- query language
- active learning
- metadata