Sfoglia per Autore
Mostrati risultati da 1 a 14 di 14
Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata
2012 G.J. Lavado, G. Pighizzini, S. Seki
Parikh’s theorem and descriptional complexity
2012 G.J. Lavado, G. Pighizzini
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
2012 G.J. Lavado, G. Pighizzini, S. Seki
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
2013 G.J. Lavado, G. Pighizzini, S. Seki
Operational state complexity under Parikh equivalence
2014 G.J. Lavado, G. Pighizzini, S. Seki
Operational State Complexity under Parikh Equivalence
2014 G.J. Lavado, G. Pighizzini, S. Seki
DESCRIPTIONAL COMPLEXITY AND PARIKH EQUIVALENCE
2015 G.J. Lavado
Minimal and reduced reversible automata
2016 G.J. Lavado, G. Pighizzini, L. Prigioniero
Minimal and reduced reversible automata
2016 G.J. Lavado, G. Pighizzini, L. Prigioniero
Minimal and reduced reversible automata
2016 G.J. Lavado, G. Pighizzini, L. Prigioniero
Weakly and strongly irreversible regular languages
2017 G.J. Lavado, G. Pighizzini, L. Prigioniero
Minimal and Reduced Reversible Automata
2017 G.J. Lavado, G. Pighizzini, L. Prigioniero
Concise representations of reversible automata
2017 G.J. Lavado, L. Prigioniero
Concise Representations of Reversible Automata
2019 G.J. Lavado, L. Prigioniero
Mostrati risultati da 1 a 14 di 14
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile