| 2008 |
|---|
| 10 | | Alexander Clark,
François Coste,
Laurent Miclet:
Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings
Springer 2008 |
| 2005 |
|---|
| 9 | EE | François Coste,
Goulven Kerbellec:
A Similar Fragments Merging Approach to Learn Automata on Proteins.
ECML 2005: 522-529 |
| 8 | EE | 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.
AI Commun. 18(2): 93-115 (2005) |
| 2004 |
|---|
| 7 | EE | François Coste,
Daniel Fredouille,
Christopher Kermorvant,
Colin de la Higuera:
Introducing Domain and Typing Bias in Automata Inference.
ICGI 2004: 115-126 |
| 6 | EE | Bradford Starkie,
François Coste,
Menno van Zaanen:
The Omphalos Context-Free Grammar Learning Competition.
ICGI 2004: 16-27 |
| 5 | EE | John Abela,
François Coste,
Sandro Spina:
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA.
ICGI 2004: 28-39 |
| 2003 |
|---|
| 4 | EE | François Coste,
Daniel Fredouille:
Unambiguous Automata Inference by Means of State-Merging Methods.
ECML 2003: 60-71 |
| 2000 |
|---|
| 3 | | François Coste,
Daniel Fredouille:
Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata.
ICGI 2000: 25-38 |
| 1998 |
|---|
| 2 | | François Coste,
Jacques Nicolas:
Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States.
ECML 1998: 37-42 |
| 1 | EE | François Coste,
Jacques Nicolas:
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.
ICGI 1998: 199-210 |
