Giovanna J. Lavado

According to our database, Giovanna J. Lavado authored at least 9 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Weakly and Strongly Irreversible Regular Languages.

Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

Int. J. Found. Comput. Sci., 2022

2019

SAR and QSAR modeling of a large collection of LD50 rat acute oral toxicity data.

Domenico Gadaleta, Kristijan Vukovic, Cosimo Toma, Giovanna J. Lavado, Agnes L. Karmaus, Kamel Mansouri, Nicole C. Kleinstreuer, Emilio Benfenati, Alessandra Roncaglioni

J. Cheminformatics, 2019

Concise Representations of Reversible Automata.

Giovanna J. Lavado, Luca Prigioniero

Int. J. Found. Comput. Sci., 2019

2017

Minimal and Reduced Reversible Automata.

Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

J. Autom. Lang. Comb., 2017

Weakly and Strongly Irreversible Regular Languages.

Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2014

Operational State Complexity under Parikh Equivalence.

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata.

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

Inf. Comput., 2013

2012

Parikh's Theorem and Descriptional Complexity.

Giovanna J. Lavado, Giovanni Pighizzini

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

Proceedings of the Developments in Language Theory - 16th International Conference, 2012