Giovanna J. Lavado

Publication Activity (10 Years)

Years Active: 2012-2022
Publications (10 Years): 9

Top Topics

Regular Languages

External Representations

Deterministic Automata

Top Venues

Int. J. Found. Comput. Sci.

Publications

Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Weakly and Strongly Irreversible Regular Languages. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Giovanna J. Lavado, Luca Prigioniero
Concise Representations of Reversible Automata. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Domenico Gadaleta, Kristijan Vukovic, Cosimo Toma, Giovanna J. Lavado, Agnes L. Karmaus, Kamel Mansouri, Nicole C. Kleinstreuer, Emilio Benfenati, Alessandra Roncaglioni
SAR and QSAR modeling of a large collection of LD50 rat acute oral toxicity data. J. Cheminformatics 11 (1) (2019)
Giovanna J. Lavado, Luca Prigioniero
Concise Representations of Reversible Automata. DCFS (2017)
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Minimal and Reduced Reversible Automata. J. Autom. Lang. Comb. 22 (1-3) (2017)
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Weakly and Strongly Irreversible Regular Languages. AFL (2017)
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Minimal and Reduced Reversible Automata. DCFS (2016)
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Minimal and Reduced Reversible Automata. CoRR (2016)
Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Minimal and Reduced Reversible Automata. ICTCS (2016)
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
Operational State Complexity under Parikh Equivalence. DCFS (2014)
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput. 228 (2013)
Giovanna J. Lavado, Giovanni Pighizzini
Parikh's Theorem and Descriptional Complexity. SOFSEM (2012)
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata CoRR (2012)
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata. Developments in Language Theory (2012)