It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular.
Volker DiekertSteffen KopeckiPublished in: Int. J. Found. Comput. Sci. (2011)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- finite automata
- decision problems
- context free languages
- positive data
- pac learning
- context free grammars
- context free
- natural language
- finite state machines
- pattern languages
- knowledge base
- matching algorithm
- query language
- uniform distribution
- active learning
- equivalence queries
- decision trees