Regular Languages Are Church-Rosser Congruential.

Volker Diekert Manfred Kufleitner Klaus Reinhardt Tobias Walter

Published in: J. ACM (2015)

Keyphrases

regular languages
regular expressions
grammatical inference
context free languages
finite automata
decision problems
context free grammars
pac learning
positive data
finite state machines
context free
pattern matching
equivalence queries
learning algorithm
active learning
semi supervised