Abstract
Abstract
Finite automata for variable assignment languages (FA-VA), a subclass of deterministic finite automata, are defined. Properties of FA-VAs are analyzed. An active learning algorithm that infers FA-VA-based models of interactive constraint-based systems is devised. Advantages and limitations of the proposed representation method and the algorithm are discussed.