Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States

@inproceedings{Coste1998InferenceOF,
  title={Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States},
  author={François Coste and Jacques Nicolas},
  booktitle={ECML},
  year={1998}
}
We investigate the set of all minimal deterministic finite automata accepting a given set of words and rejecting another given set of words. We present several criteria to order the exploration of the corresponding search space. Three criteria are shown to have a very good behavior with respect to the pruning they imply in the search space. Best results have been obtained for the prefix ordering. We have also worked on a new dynamic ordering based on an entropy computation. 
2 Citations
Grammatical Inference: Learning Automata and Grammars
TLDR
The author describes a number of techniques and algorithms that allow us to learn from text, from an informant, or through interaction with the environment that concern automata, grammars, rewriting systems, pattern languages or transducers.
Similarity Learning and Stochastic Language Models for Tree-Represented Music
TLDR
This dissertation tries to built a system that allowed to classify and generate melodies using the information from the tree encoding, capturing the inherent dependencies which are inside this kind of structure, and improving the current methods in terms of accuracy and running time.

References

SHOWING 1-7 OF 7 REFERENCES
What Is the Search Space of the Regular Inference?
This paper revisits the theory of regular inference, in particular by extending the definition of structural completeness of a positive sample and by demonstrating two basic theorems. This framework
Regular Inference as a graph coloring problem
TLDR
A compact representation of G is proposed, based on the set of admissible merging of states, that may be represented with a set of unequality constraints and given an eecient algorithm to build the elements of G, reducing the problem to the coloring of the graph of constraints.
Random DFA's can be approximately learned from sparse uniform examples
TLDR
Empirically found that DFA's are approximately learnable from sparse data when the target machine and training set are selected at random.
Utilisation et apprentissage de modeles de langage pour la reconnaissance de la parole continue
Le present travail s'interesse a la modelisation du langage pour la reconnaissance de la parole continue. Cette modelisation a pour objectif le controle du decodage acoustique par une information
Merge Order count NECI Tech Report
  • Merge Order count NECI Tech Report
  • 1997
Finite Automata : Behavior and Synthesis Amsterdam
  • Finite Automata : Behavior and Synthesis Amsterdam