The Average State Complexity of the Star of a Finite Set of Words Is Linear. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (Developments in Language Theory, 2008)

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. - Laura Giambruno; Antonio Restivo (RAIRO Theor. Informatics Appl., 2008)

On-line Construction of a Small Automaton for a Finite Set of Words. - Maxime Crochemore; Laura Giambruno (Stringology, 2009)

Complexity of Operations on Cofinite Languages. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (LATIN, 2010)

The Average State Complexity of Rational Operations on Finite Languages. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (Int. J. Found. Comput. Sci., 2010)

Transducers for the bidirectional decoding of prefix codes. - Laura Giambruno; Sabrina Mantaci (Theor. Comput. Sci., 2010)

On-Line Construction of a Small Automaton for a Finite Set of Words. - Maxime Crochemore; Laura Giambruno; Alessio Langiu (Int. J. Found. Comput. Sci., 2012)

On the size of transducers for bidirectional decoding of prefix codes. - Laura Giambruno; Sabrina Mantaci (RAIRO Theor. Informatics Appl., 2012)

Dictionary-symbolwise flexible parsing. - Maxime Crochemore; Laura Giambruno; Alessio Langiu; Filippo Mignosi; Antonio Restivo (J. Discrete Algorithms, 2012)

On the Number of Prefix and Border Tables. - Julien Clément 001; Laura Giambruno (LATIN, 2014)

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. - Laura Giambruno; Sabrina Mantaci; Jean Néraud; Carla Selmi (Int. J. Found. Comput. Sci., 2015)

Representing prefix and border tables: results on enumeration. - Julien Clément 001; Laura Giambruno (Math. Struct. Comput. Sci., 2017)