( en | de | ru )

 

Disambiguation of "Giambruno, Laura"

Author of the publication

copydeleteadd this publication to your clipboard
The Average State Complexity of Rational Operations on Finite Languages.

, , and . Int. J. Found. Comput. Sci., 21 (4): 495-516 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mario Laura

Marco Laurati

Laura Dreiner

Anatomisch-histologische Variationen des Labrum glenoidale bei erwachsenen Hunden verschiedener Rassen im Vergleich zum jungen Beagle unter besonderer Berücksichtigung des Kollagenfaserverlaufs. Uni Gießen, (2009)

Laura Oberlin

Behandlung von Pankreaskarzinomzelllinien in vitro und in vivo mit einem monoklonalen Antikörper gegen den Transferrinrezeptor. Uni Gießen, (2009)

Laura Battafarano

 

Other publications of authors with the same name

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid., and . RAIRO Theor. Informatics Appl., 42 (3): 503-524 (2008)A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay., , , and . Int. J. Found. Comput. Sci., 26 (6): 733-750 (2015)The Average State Complexity of the Star of a Finite Set of Words Is Linear., , and . Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 134-145. Springer, (2008)On the size of transducers for bidirectional decoding of prefix codes., and . RAIRO Theor. Informatics Appl., 46 (2): 315-328 (2012)A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay., , , and . Developments in Language Theory, volume 7410 of Lecture Notes in Computer Science, page 471-476. Springer, (2012)Transducers for the bidirectional decoding of prefix codes., and . Theor. Comput. Sci., 411 (16-18): 1785-1792 (2010)On-line Construction of a Small Automaton for a Finite Set of Words., and . Stringology, page 15-28. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Representing prefix and border tables: results on enumeration., and . Math. Struct. Comput. Sci., 27 (2): 257-276 (2017)Complexity of Operations on Cofinite Languages., , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 222-233. Springer, (2010)The Average State Complexity of Rational Operations on Finite Languages., , and . Int. J. Found. Comput. Sci., 21 (4): 495-516 (2010)