Journals


1. J. Clément and L. Giambruno Representing prefix and border tables: results on enumeration. Mathematical Structures in Computer Science. Submitted. February 2014

2. L. Giambruno, S. Mantaci, J. Néraud and C. Selmi A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay. International Journal of Foundations of Computer Science. Submitted. December 2013

3. M. Crochemore, L. Giambruno, A. Langiu, F. Mignosi and A. Restivo. Dictionary-Symbolwise Flexible Parsing. Journal of Discrete Algorithms. Vol. 14 : 74-90, July 2012

4. M. Crochemore, L. Giambruno and A. Langiu. On-line construction of a small automaton for a finite set of words. International Journal of Foundations of Computer Science. Vol. 23, Issue 2, pp. 281-301, March 2012

5. L. Giambruno and S. Mantaci. On the size of transducers for bidirectional decoding of prefix codes. Rairo-Theoretical Informatics and Applications. Cambridge University Press, DOI:10.1051/ita/2012006 . February 2012.

6. L. Giambruno and S. Mantaci. Transducers for bidirectional decoding of prefix codes. Theoretical Computer Science. Vol. 411, pp. 1785-1792, March 2010.

7. F. Bassino, L. Giambruno, and C. Nicaud. The average state complexity of rational operations on finite languages is linear. International Journal of Foundations of Computer Science. Vol. 21, Issue 4, pp. 495-516, 2010.

8. L. Giambruno and A. Restivo. An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. Rairo-Theoretical informatics and applications (on line). 2008. Vol. 42, pp. 503– 524.

In proceedings


1. J. Clément and L. Giambruno On the number of prefix and border tables. LATIN 2014 (Latin American Theoretical INformatics) , Montevideo, Uruguay. To appear in Lecture Notes in Computer Science.

2. L. Giambruno, S. Mantaci, J. Néraud and C. Selmi A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay. 16th International Conference on Developments in Language Theory (DLT 2012) , Taipei, Taiwan. August 2012. Lecture Notes in Computer Science. Volume 7410, pp 471-476, Springer-Verlag.

3. L. Giambruno and S. Mantaci. State complexities of transducers for bidirectional decoding of prefix codes. 12st Italian Conference on Theoretical Computer Science (ICTCS 2010). Camerino, Italy. September 15-17, 2010. In electronic proceedings.

4. L. Giambruno and S. Mantaci. State complexities of transducers for bidirectional decoding of prefix codes. 13iemes Journes Montoises d'Informatique Théorique 2010 (JM'10). Amiens, France. September 6-10, 2010. In proceedings.

5. M. Crochemore, L. Giambruno, A. Langiu, F. Mignosi and A. Restivo. Dictionary-Symbolwise Flexible Parsing 21st International Workshop on Combinatorial Algorithms (IWOCA 2010). London, UK. July 26-28, 2010. Lecture Notes in Computer Science. Volume 6460, pp 390-403. Springer-Verlag.

6. F. Bassino, L. Giambruno and C. Nicaud. Complexity of operations on cofinite languages. 9th Latin American Theoretical Informatics Symposium (LATIN'10). Oaxaca, Mexico. April 2010. Lecture Notes in Computer Science. Volume 6034, pp 222 -233. Springer-Verlag.

7. M. Crochemore and L. Giambruno. On-line construction of a small automaton for a finite set of words. The Prague Stringology Conference 2009 (PSC 2009). 2009. pp 15–28. In proceedings.

8. F. Bassino, L. Giambruno and C. Nicaud. The average state complexity of the star of a finite set of words is linear. In, Masami Ito, Masafumi Toyama, editors, International Conference on Developments in Language Theory (DLT '08). vol.5257. Lecture Notes in Computer Science.Kyoto, Japan. September 2008. pp.134–145. Springer-Verlag

9. L. Giambruno and A. Restivo. An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. Mons Days of Theoretical Computer Science (JM '06). 2006. In proceedings.


Books


- L. Giambruno Automata-theoretic methods in free monoids and free groups. LAP Lambert Academic Publishing ( 2014-02-17 ). ISBN 978-3-8484-3165-6.

Ph.D. thesis


- L. Giambruno Automata-theoretic methods in free monoids and free groups. Ph-D thesis in Informatic and Mathematic, XVIII ciclo, Dipartimento di Matematica e Applicazioni, Palermo. Supervisor: professor A. Restivo. April 2007.



Others publications


1. L. Giambruno and A. Restivo An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. preprint. Aprile 2007.

My co-authors

-Frédérique Bassino
-Julien Clément
- M. Crochemore
-Alessio Langiu
-Sabrina Mantaci
-Filippo Mignosi
-Jean Néraud
- Cyril Nicaud
- Antonio Restivo
- Carla Selmi