Angluin-Style Learning of NFA - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Angluin-Style Learning of NFA

Peter Habermehl
  • Function : Author
Carsten Kern
  • Function : Author
Martin Leucker
  • Function : Author


We introduce NL*, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similarly as in Angluin's popular L* algorithm, which, however, learns deterministic finite-state automata (DFA). Like in a DFA, the states of an RFSA represent residual languages. Unlike a DFA, an RFSA restricts to prime residual languages, which cannot be described as the union of other residual languages. In doing so, RFSA can be exponentially more succinct than DFA. They are, therefore, the preferable choice for many learning applications. The implementation of our algorithms is applied to a collection of examples and confirms the expected advantage of NL* over L*.


Other [cs.OH]
No file

Dates and versions

hal-00772636 , version 1 (10-01-2013)


  • HAL Id : hal-00772636 , version 1


Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker. Angluin-Style Learning of NFA. Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), Jul 2009, Pasadena, CA, USA, United States. pp.1004-1009. ⟨hal-00772636⟩
393 View
0 Download


Gmail Facebook Twitter LinkedIn More