| 2008 |
|---|
| 10 | EE | Christophe Costa Florêncio:
Learning Node Label Controlled Graph Grammars (Extended Abstract).
ICGI 2008: 286-288 |
| 2007 |
|---|
| 9 | EE | Christophe Costa Florêncio:
Tree Planar Languages.
ICDM Workshops 2007: 405-410 |
| 2006 |
|---|
| 8 | EE | Alexander Clark,
Christophe Costa Florêncio,
Chris Watkins:
Languages as Hyperplanes: Grammatical Inference with String Kernels.
ECML 2006: 90-101 |
| 7 | EE | Alexander Clark,
Christophe Costa Florêncio,
Chris Watkins,
Mariette Sérayet:
Planar Languages and Learnability.
ICGI 2006: 148-160 |
| 2003 |
|---|
| 6 | EE | Christophe Costa Florêncio:
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable.
EACL 2003: 75-82 |
| 2002 |
|---|
| 5 | EE | Christophe Costa Florêncio:
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard.
ICGI 2002: 49-62 |
| 2001 |
|---|
| 4 | | Christophe Costa Florêncio:
Conservative vs Set-driven Learning Functions for the Classes k-valued.
CLIN 2001: 38-46 |
| 3 | EE | Christophe Costa Florêncio:
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard.
LACL 2001: 125-138 |
| 2000 |
|---|
| 2 | | Christophe Costa Florêncio:
On the Complexity of Consistent Identification of Some Classes of Structure Languages.
ICGI 2000: 89-102 |
| 1999 |
|---|
| 1 | EE | Christophe Costa Florêncio:
Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard.
CLIN 1999 |
