( en | de | ru )

 

Disambiguation of "Coste, François"

Author of the publication

copydeleteadd this publication to your clipboard
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.

, and . ICGI, volume 1433 of Lecture Notes in Computer Science, page 199-210. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

François Weirich

François Elvinger

François Melis

François Guers

François Franceschi

 

Other publications of authors with the same name

Unambiguous Automata Inference by Means of State-Merging Methods., and . ECML, volume 2837 of Lecture Notes in Computer Science, page 60-71. Springer, (2003)Inference of Finite Automata: Reducing the Search Space with an Ordering of Pairs of States., and . ECML, volume 1398 of Lecture Notes in Computer Science, page 37-42. Springer, (1998)Introducing Domain and Typing Bias in Automata Inference., , , and . ICGI, volume 3264 of Lecture Notes in Computer Science, page 115-126. Springer, (2004)The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing, , , and . MDPI Algorithms, 4 (4): 262--284 (2011)How to measure the topological quality of protein parse trees?, , and . ICGI, volume 93 of Proceedings of Machine Learning Research, page 118-138. PMLR, (2018)Learning local substitutable context-free languages from positive examples in polynomial time and data by reduction., and . ICGI, volume 93 of Proceedings of Machine Learning Research, page 155-168. PMLR, (2018)Efficient Ambiguity Detection in C-NFA, a Step Towards the Inference on Non Deterministic Automata., and . ICGI, volume 1891 of Lecture Notes in Computer Science, page 25-38. Springer, (2000)Progressing the state-of-the-art in grammatical inference by competition: The Omphalos Context-Free Language Learning Competition., , and . AI Commun., 18 (2): 93-115 (2005)Deep learning languages: a key fundamental shift from probabilities to weights?. CoRR, (2019)A Similar Fragments Merging Approach to Learn Automata on Proteins., and . ECML, volume 3720 of Lecture Notes in Computer Science, page 522-529. Springer, (2005)