Laura Giambruno

According to our database1, Laura Giambruno authored at least 12 papers between 2008 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Representing prefix and border tables: results on enumeration.
Math. Struct. Comput. Sci., 2017

2015
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Int. J. Found. Comput. Sci., 2015

2014
On the Number of Prefix and Border Tables.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2012
Dictionary-symbolwise flexible parsing.
J. Discrete Algorithms, 2012

On the size of transducers for bidirectional decoding of prefix codes.
RAIRO Theor. Informatics Appl., 2012

On-Line Construction of a Small Automaton for a Finite Set of Words.
Int. J. Found. Comput. Sci., 2012

2010
Transducers for the bidirectional decoding of prefix codes.
Theor. Comput. Sci., 2010

The Average State Complexity of Rational Operations on Finite Languages.
Int. J. Found. Comput. Sci., 2010

Complexity of Operations on Cofinite Languages.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
On-line Construction of a Small Automaton for a Finite Set of Words.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid.
RAIRO Theor. Informatics Appl., 2008

The Average State Complexity of the Star of a Finite Set of Words Is Linear.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008


  Loading...