GIAMBRUNO, Laura
GIAMBRUNO, Laura
Mostra
records
Risultati 1 - 11 di 11 (tempo di esecuzione: 0.026 secondi).
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
2006-01-01 GIAMBRUNO L; RESTIVO A
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
2008-01-01 GIAMBRUNO, L; RESTIVO, A
Complexity of operations on cofinite languages
2010-01-01 Bassino, F; Giambruno, L; Nicaud, C
Dictionary-symbolwise flexible parsing
2012-01-01 Crochemore, M; Giambruno, L; Langiu, A; Mignosi, F; Restivo, A
Dictionary-Symbolwise Flexible Parsing
2011-01-01 CROCHEMORE, M; GIAMBRUNO, L; LANGIU, A; MIGNOSI, F; RESTIVO, A
On the size of transducers for bidirectional decoding of prefix codes
2012-01-01 Giambruno, L; Mantaci, S
On-line construction of a small automaton for a finite set of words
2009-01-01 Crochemore, M; Giambruno, L
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012-01-01 Crochemore, M; Giambruno, L; Langiu, A
The average state complexity of rational operations on finite languages is linear
2010-01-01 Bassino, F; Giambruno, L; Nicaud, C
The average state complexity of the star of a finite set of words is linear.
2008-01-01 Bassino, F; Giambruno, L; Nicaud, C;
Transducers for the bidirectional decoding of prefix codes
2010-01-01 Giambruno, L; Mantaci, S
| Data di pubblicazione | Titolo | Autori | Tipologia | Autore(i) | File |
|---|---|---|---|---|---|
| 1-gen-2006 | An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid | GIAMBRUNO, LauraRESTIVO, Antonio | 10 - Proceedings::Proceedings | GIAMBRUNO L; RESTIVO A | |
| 1-gen-2008 | An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid | GIAMBRUNO, LauraRESTIVO, Antonio | 01 - Contributo in rivista::1.01 Articolo in rivista | GIAMBRUNO, L; RESTIVO, A | |
| 1-gen-2010 | Complexity of operations on cofinite languages | GIAMBRUNO, Laura + | 10 - Proceedings::Proceedings | Bassino, F; Giambruno, L; Nicaud, C | |
| 1-gen-2012 | Dictionary-symbolwise flexible parsing | GIAMBRUNO, LauraLANGIU, AlessioRESTIVO, Antonio + | 01 - Contributo in rivista::1.01 Articolo in rivista | Crochemore, M; Giambruno, L; Langiu, A; Mignosi, F; Restivo, A | |
| 1-gen-2011 | Dictionary-Symbolwise Flexible Parsing | GIAMBRUNO, LauraLANGIU, AlessioRESTIVO, Antonio + | 10 - Proceedings::Proceedings | CROCHEMORE, M; GIAMBRUNO, L; LANGIU, A; MIGNOSI, F; RESTIVO, A | |
| 1-gen-2012 | On the size of transducers for bidirectional decoding of prefix codes | GIAMBRUNO, LauraMANTACI, Sabrina | 01 - Contributo in rivista::1.01 Articolo in rivista | Giambruno, L; Mantaci, S | |
| 1-gen-2009 | On-line construction of a small automaton for a finite set of words | GIAMBRUNO, Laura + | 10 - Proceedings::Proceedings | Crochemore, M; Giambruno, L | |
| 1-gen-2012 | ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS | GIAMBRUNO, LauraLANGIU, Alessio + | 01 - Contributo in rivista::1.01 Articolo in rivista | Crochemore, M; Giambruno, L; Langiu, A | |
| 1-gen-2010 | The average state complexity of rational operations on finite languages is linear | GIAMBRUNO, Laura + | 01 - Contributo in rivista::1.01 Articolo in rivista | Bassino, F; Giambruno, L; Nicaud, C | |
| 1-gen-2008 | The average state complexity of the star of a finite set of words is linear. | GIAMBRUNO, Laura + | 10 - Proceedings::Proceedings | Bassino, F; Giambruno, L; Nicaud, C; | |
| 1-gen-2010 | Transducers for the bidirectional decoding of prefix codes | GIAMBRUNO, LauraMANTACI, Sabrina | 01 - Contributo in rivista::1.01 Articolo in rivista | Giambruno, L; Mantaci, S |