LAVADO, GIOVANNA JANET

LAVADO, GIOVANNA JANET  

Dipartimento di Informatica Giovanni Degli Antoni  

Mostra records
Risultati 1 - 14 di 14 (tempo di esecuzione: 0.0 secondi).
Titolo Data di pubblicazione Autori Tipo File Abstract
Concise Representations of Reversible Automata 2019 Lavado G. J.Prigioniero L. Article (author) -
Minimal and Reduced Reversible Automata 2017 G.J. LavadoG. PighizziniL. Prigioniero Article (author) -
Concise representations of reversible automata 2017 G.J. LavadoL. Prigioniero Book Part (author) -
Weakly and strongly irreversible regular languages 2017 G.J. LavadoG. PighizziniL. Prigioniero Article (author) -
Minimal and reduced reversible automata 2016 Lavado G. J.Pighizzini G.Prigioniero L. Article (author) -
Minimal and reduced reversible automata 2016 LAVADO, GIOVANNA JANETG. PighizziniPRIGIONIERO, LUCA Book Part (author) -
Minimal and reduced reversible automata 2016 G.J. LavadoG. PighizziniL. Prigioniero Book Part (author) -
DESCRIPTIONAL COMPLEXITY AND PARIKH EQUIVALENCE 2015 G.J. Lavado Doctoral Thesis -
Operational State Complexity under Parikh Equivalence 2014 G.J. LavadoG. Pighizzini + Conference Object -
Operational state complexity under Parikh equivalence 2014 G.J. LavadoG. Pighizzini + Book Part (author) -
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata 2013 G.J. LavadoG. Pighizzini + Article (author) -
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata 2012 G.J. LavadoG. Pighizzini + Conference Object -
Parikh’s theorem and descriptional complexity 2012 G.J. LavadoG. Pighizzini Book Part (author) -
Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata 2012 G.J. LavadoG. Pighizzini + Book Part (author) -