Inductive inference of logical DES controllers using the L* algorithm
Xiaojun Yang, Michael D. Lemmon, Panos J. Antsaklis · 2005
It is well known that learning procedures such as the L* algorithm will infer minimal deterministic finite automatons (DFA) in polynomial time through the use of membership and equivalence queries. This paper introduces a modification of the L*-algorithm that can be used for the inductively inferring optimal logical DES controllers in which prior knowledge of the plant is confined to a finite lookahead window of predicted behaviours.