The SCEAS System
Navigation Menu

Search the dblp DataBase


François Coste: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Coste, Daniel Fredouille
    Unambiguous Automata Inference by Means of State-Merging Methods. [Citation Graph (0, 0)][DBLP]
    ECML, 2003, pp:60-71 [Conf]
  2. François Coste, Goulven Kerbellec
    A Similar Fragments Merging Approach to Learn Automata on Proteins. [Citation Graph (0, 0)][DBLP]
    ECML, 2005, pp:522-529 [Conf]
  3. 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:37-42 [Conf]
  4. 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:28-39 [Conf]
  5. François Coste, Daniel Fredouille
    Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:25-38 [Conf]
  6. 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:115-126 [Conf]
  7. 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:199-210 [Conf]
  8. Bradford Starkie, François Coste, Menno van Zaanen
    The Omphalos Context-Free Grammar Learning Competition. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:16-27 [Conf]
  9. Bradford Starkie, François Coste, Menno van Zaanen
    Progressing the state-of-the-art in grammatical inference by competition: The Omphalos Context-Free Language Learning Competition. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2005, v:18, n:2, pp:93-115 [Journal]

  10. In-place Update of Suffix Array while Recoding Words. [Citation Graph (, )][DBLP]

  11. Choosing Word Occurrences for the Smallest Grammar Problem. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002