Document in the database:

Details   Results of the Abbadingo One DFA Learning Competition and a New Evidence Driven State Merging Algorithm (1998) Kevin J. Lang, Barak A. Pearlmutter, Rodney Price

28 documents cite this article.

Citing documents:

Details   A New Algorithm For The Reduction Of Incompletely Specified Finite State Machines Jorge M. Pena, Arlindo L. Oliveira A New Algorithm For The Reduction Of Incompletely Specified Finite

Details   A Stochastic Search Approach to Grammar Induction (1998) Hugues Juille, Jordan

Details   Stochastic Grammatical Inference of Text Database Structure (2000) Matthew

Details   Evidence Driven State Merging with Search (1998) Kevin J. Lang

Details   Efficient algorithms for the inference of minimum size DFAs Arlindo L.

Details   Stochastic Grammatical Inference of Text Database Structure (2000) Matthew

Details   State Merging Inference of Finite State Classifiers (1999) François

Details   Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality Franck Thollard Thollard Probabilistic DFA Inference using Kullback-Leibler Divergence and

Details   Grammatical Inference as Unification (1999) Jacques Nicolas

Details   Faster Algorithms for Finding Minimal Consistent DFAs (1999) Kevin J. Lang

Details   Using Finite Automata to Mine Execution Data for Intrusion Detection: a Preliminary Report C. C. Michael, Anup Ghosh Using Finite Automata to Mine Execution Data for Intrusion Detection: a

Details   Inference of omega-Languages from Prefixes Colin de la Higuera, Jean-Chr

Details   On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data Colin de la Higuera, José Oncina On Sufficient Conditions to Identify in the Limit Classes of Grammars

Details   Learning Regular Languages using RFSA (2001) François Denis, Auré

Details   Learning Probabilistic Residual Finite State Automata (2002) Yann Esposito,

Details   Stochastic grammatical inference with Multinomial Tests (2002) Christopher

Details   Learning Regular Languages using RFSAs (2001) François Denis, Auré

Details   Learning Languages with Help (2002) Christopher Kermorvant, Colin de la Higuera

Details   Stochastic Grammatical Inference with Multinomial Tests (2002) Christopher

Details   Learning Regular Languages Using Non Deterministic Finite Automata (2000) Fran&

Details   Shallow Parsing using Probabilistic Grammatical Inference (2002) Franck

Details   Efficient Ambiguity Detection in C-NFA: A Step Towards the Inference of Non Deterministic Automata François Coste, Daniel Fredouille Efficient Ambiguity Detection in C-NFA: A Step Towards the Inference of

Details   Grammatical inference for disulfide bonds prediction within proteins (2003)

Details   Grammar Inference, Automata Induction, and Language Acquisition (2000) Rajesh

Details   A New Algorithm for Exact Reduction of Incompletely Specified Finite State Machines Jorge M. Pena, Arlindo L. Oliveira A New Algorithm for Exact Reduction of Incompletely Specified Finite

Details   A Technique for Verifying Component-Based Software (2004) Leonardo Mariani,

Details   The Omphalos Context-Free Grammar Learning Competition Bradford Starkie

Details   Classifying Sentences using Induced Structure (2005) Menno van Zaanen, Luiz

CiteSeer.IST - Copyright Penn State and NEC