Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata. - Giovanna J. Lavado; Giovanni Pighizzini; Shinnosuke Seki 001 (Developments in Language Theory, 2012)

Parikh's Theorem and Descriptional Complexity. - Giovanna J. Lavado; Giovanni Pighizzini (SOFSEM, 2012)

Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. - Giovanna J. Lavado; Giovanni Pighizzini; Shinnosuke Seki 001 (Inf. Comput., 2013)

Operational State Complexity under Parikh Equivalence. - Giovanna J. Lavado; Giovanni Pighizzini; Shinnosuke Seki 001 (DCFS, 2014)

Weakly and Strongly Irreversible Regular Languages. - Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (AFL, 2017)

Minimal and Reduced Reversible Automata. - Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (J. Autom. Lang. Comb., 2017)

Concise Representations of Reversible Automata. - Giovanna J. Lavado; Luca Prigioniero (Int. J. Found. Comput. Sci., 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)

Weakly and Strongly Irreversible Regular Languages. - Bruno Guillon; Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2022)