17 citations · 24 across the 4 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2012
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a…
cs.FL2012★ 4 cited
Two-Way Finite Automata: Old and Recent Results
Giovanni Pighizzini
The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rabin and Scott and, independently, Shepherdson, proved that these models, both in…
cs.FL2010★ 4 cited
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems
Ian McQuillan, Giovanni Pighizzini
The 12th annual workshop, Descriptional Complexity of Formal Systems 2010, is taking place in Saskatoon, Canada, on August 8-10, 2010. It is jointly organized by the IFIP Working G…