Automata learning.

The general question is: find an automaton for which the accepting language satisfies 
a given set of requirements, like strings that should be or should not be accepted.
This is a very natural question: the learned automaton describes a
model = language of strings, and can be used to predict
whether a new string is in the language or not.

Standard algorithms in this area (Angluin) are extensively used, but only yield
DFAs. Questions in this area for more general types of automata can be expressed in 
SAT/SMT. Then also other types of requirements can be expressed, e.g.,
related to transition systems and modal formulas.

Research topic: Figure out how to do this, compare several approaches, compare to 
standard algorithms.

Contact: Hans Zantema, h.zantema@tue.nl