| 2025 | DLT | Turn Complexity of Context-Free Languages, Pushdown andOne-Counter Automata. | Giovanni Pighizzini |
| 2022 | DLT | Performing Regular Operations with 1-Limited Automata. | Giovanni Pighizzini, Luca Prigioniero, Simon Sdovsk |
| 2021 | LATA | Usefulness of Information and Unary Languages. | Giovanni Pighizzini, Branislav Rovan, Simon Sdovsk |
| 2018 | DLT | Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. | Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa |
| 2017 | DLT | Limited Automata and Unary Languages. | Giovanni Pighizzini, Luca Prigioniero |
| 2016 | LATA | Restricted Turing Machines and Language Recognition. | Giovanni Pighizzini |
| 2015 | SOFSEM | Optimal State Reductions of Automata with Partially Specified Behaviors. | Nelma Moreira, Giovanni Pighizzini, Rogrio Reis |
| 2012 | CSR | Two-Way Automata Characterizations of L/poly versus NL. | Christos A. Kapoutsis, Giovanni Pighizzini |
| 2012 | DLT | Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata. | Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki |
| 2012 | LATA | Two-Way Automata Making Choices Only at the Endmarkers. | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |
| 2012 | LATIN | Oblivious Two-Way Finite Automata: Decidability and Complexity. | Martin Kutrib, Andreas Malcher, Giovanni Pighizzini |
| 2012 | MFCS | Reversal Hierarchies for Small 2DFAs. | Christos A. Kapoutsis, Giovanni Pighizzini |
| 2012 | SOFSEM | Parikh's Theorem and Descriptional Complexity. | Giovanna J. Lavado, Giovanni Pighizzini |
| 2010 | DLT | Two-Way Unary Automata versus Logarithmic Space. | Viliam Geffert, Giovanni Pighizzini |
| 2010 | LATIN | Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. | Viliam Geffert, Giovanni Pighizzini |
| 2009 | LATA | Converting Self-verifying Automata into Deterministic Automata. | Galina Jirskov, Giovanni Pighizzini |
| 2007 | DLT | Descriptional Complexity of Bounded Context-Free Languages. | Andreas Malcher, Giovanni Pighizzini |
| 2005 | DLT | Complementing Two-Way Finite Automata. | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 2001 | MFCS | Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 2000 | MFCS | Unary Pushdown Automata and Auxiliary Space Lower Bounds. | Giovanni Pighizzini |
| 1998 | STACS | Optimal Simulations Between Unary Automata. | Carlo Mereghetti, Giovanni Pighizzini |
| 1997 | MFCS | Distances Between Languages and Reflexivity of Relations. | Christian Choffrut, Giovanni Pighizzini |
| 1995 | FCT | How Hard is to Compute the Edit Distance. | Giovanni Pighizzini |
| 1995 | MFCS | Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. | Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini |
| 1994 | MFCS | On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. | Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini |
| 1991 | FCT | The Complexity of Computing Maximal Word Functions. | Danilo Bruschi, Giovanni Pighizzini |
| 1988 | STACS | On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. | Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini |