How considering incompatible state mergings may reduce the DFA induction search tree

A simple and effective method for DFA induction from positive and negative samples is the state merging method. The corresponding search space may be tree-structured, considering two subspaces for a given pair of states: the subspace where states are merged and the subspace where states remain diffe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Coste, François, Nicolas, Jacques
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems constraint system DFA Exact sciences and technology Grammatical inference search tree Speech and sound recognition and synthesis. Linguistics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!