
Search the dblp DataBase
François Coste:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 François Coste, Daniel Fredouille
Unambiguous Automata Inference by Means of StateMerging Methods. [Citation Graph (0, 0)][DBLP] ECML, 2003, pp:6071 [Conf]
 François Coste, Goulven Kerbellec
A Similar Fragments Merging Approach to Learn Automata on Proteins. [Citation Graph (0, 0)][DBLP] ECML, 2005, pp:522529 [Conf]
 François Coste, Jacques Nicolas
Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States. [Citation Graph (0, 0)][DBLP] ECML, 1998, pp:3742 [Conf]
 John Abela, François Coste, Sandro Spina
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:2839 [Conf]
 François Coste, Daniel Fredouille
Efficient Ambiguity Detection in CNFA, a Step Towards the Inference on Non Deterministic Automata. [Citation Graph (0, 0)][DBLP] ICGI, 2000, pp:2538 [Conf]
 François Coste, Daniel Fredouille, Christopher Kermorvant, Colin de la Higuera
Introducing Domain and Typing Bias in Automata Inference. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:115126 [Conf]
 François Coste, Jacques Nicolas
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree. [Citation Graph (0, 0)][DBLP] ICGI, 1998, pp:199210 [Conf]
 Bradford Starkie, François Coste, Menno van Zaanen
The Omphalos ContextFree Grammar Learning Competition. [Citation Graph (0, 0)][DBLP] ICGI, 2004, pp:1627 [Conf]
 Bradford Starkie, François Coste, Menno van Zaanen
Progressing the stateoftheart in grammatical inference by competition: The Omphalos ContextFree Language Learning Competition. [Citation Graph (0, 0)][DBLP] AI Commun., 2005, v:18, n:2, pp:93115 [Journal]
Inplace Update of Suffix Array while Recoding Words. [Citation Graph (, )][DBLP]
Choosing Word Occurrences for the Smallest Grammar Problem. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
