Learning Regular Languages Using Non Deterministic Finite Automata.

François Denis Aurélien Lemay Alain Terlutte

Published in: ICGI (2000)

Keyphrases

deterministic finite automata
regular expressions
learning algorithm
grammatical inference
regular languages
learning tasks
context free languages
decision trees
active learning
np hard
integrity constraints
learning problems
context free grammars