What is the Search Space for the Inference of Non Deterministic, Unambiguous and Deterministic Automata ? - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2003

What is the Search Space for the Inference of Non Deterministic, Unambiguous and Deterministic Automata ?

Résumé

A classical problem in inferring automata from data is to find the smallest compatible automaton, i.e. the smallest automaton accepting all examples and rejecting all counter-examples. We are interested in Non-deterministic Finite Automata (NFA) inference which is better suited to Occam's razor optimization principle than Deterministic Finite Automata (DFA). We revisit the existing results on the search space in the state-merging framework, focusing on nondeterminism. We introduce unambiguous automata (UFA) inference, an intermediate between the difficult NFA inference framework and the weaker DFA inference framework. The UFA search space, though containing nondeterministic automata, shares many properties with the DFA search space. Our conclusion is that the search spaces of UFA and DFA are lattices when using adequate operators.
Fichier principal
Vignette du fichier
RR-4907.pdf (475.18 Ko) Télécharger le fichier

Dates et versions

inria-00071673 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071673 , version 1

Citer

François Coste, Daniel Fredouille. What is the Search Space for the Inference of Non Deterministic, Unambiguous and Deterministic Automata ?. [Research Report] RR-4907, INRIA. 2003. ⟨inria-00071673⟩
136 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More