Laura Giambruno

Available identifiers

zbMath Open giambruno.lauraMaRDI QIDQ450550

List of research outcomes

Publication	Date of Publication	Type
Representing prefix and border tables: results on enumeration	2017-04-04	Paper
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay	2015-12-11	Paper
On the Number of Prefix and Border Tables	2014-03-31	Paper
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay	2012-11-02	Paper
Dictionary-symbolwise flexible parsing	2012-09-13	Paper
On-line construction of a small automaton for a finite set of words	2012-08-30	Paper
On the size of transducers for bidirectional decoding of prefix codes	2012-06-04	Paper
Dictionary-Symbolwise Flexible Parsing	2011-05-19	Paper
THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES	2010-09-06	Paper
Complexity of Operations on Cofinite Languages	2010-04-27	Paper
Transducers for the bidirectional decoding of prefix codes	2010-04-15	Paper
The Average State Complexity of the Star of a Finite Set of Words Is Linear	2008-10-30	Paper
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid	2008-09-25	Paper

Research outcomes over time

This page was built for person: Laura Giambruno