On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. - Danilo Bruschi; Giovanni Pighizzini; Nicoletta Sabadini (STACS, 1988)

The Complexity of Computing Maximal Word Functions. - Danilo Bruschi; Giovanni Pighizzini (FCT, 1991)

Recognizing sets of labelled acyclic graphs. - Paola Bonizzoni; Giancarlo Mauri; Giovanni Pighizzini; Nicoletta Sabadini (Tree Automata and Languages, 1992)

The Complexity of Computing Maximal Word Functions. - Eric Allender; Danilo Bruschi; Giovanni Pighizzini (Comput. Complex., 1993)

On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1994)

An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Corrigendum: An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Asynchronous Automata Versus Asynchronous Cellular Automata. - Giovanni Pighizzini (Theor. Comput. Sci., 1994)

On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages - Danilo Bruschi; Giovanni Pighizzini; Nicoletta Sabadini (Inf. Comput., 1994)

How Hard is to Compute the Edit Distance. - Giovanni Pighizzini (FCT, 1995)

Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1995)

A Remark on Middle Space Bounded Alternating Turing Machines. - Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1995)

Probabilistic Asynchronous Automata. - S. Jesi; Giovanni Pighizzini; Nicoletta Sabadini (Math. Syst. Theory, 1996)

Sublogarithmic Bounds on Space and Reversals. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (SIAM J. Comput., 1998)

Unary Pushdown Automata and Auxiliary Space Lower Bounds. - Giovanni Pighizzini (MFCS, 2000)

Unary Language Concatenation and Its State Complexity. - Giovanni Pighizzini (CIAA, 2000)

Two-Way Automata Simulations and Unary Languages. - Carlo Mereghetti; Giovanni Pighizzini (J. Autom. Lang. Comb., 2000)

On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. - Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (DCFS, 2001)

How Hard Is Computing the Edit Distance? - Giovanni Pighizzini (Inf. Comput., 2001)

Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. - Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (RAIRO Theor. Informatics Appl., 2001)

Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. - Massimiliano Milani; Giovanni Pighizzini (J. Autom. Lang. Comb., 2001)

Optimal Simulations between Unary Automata. - Carlo Mereghetti; Giovanni Pighizzini (SIAM J. Comput., 2001)

Unary Language Operations, State Complexity and Jacobsthal's Function. - Giovanni Pighizzini; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2002)

Simulating finite automata with context-free grammars. - Michael Domaratzki; Giovanni Pighizzini; Jeffrey O. Shallit (Inf. Process. Lett., 2002)

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. - Giovanni Pighizzini; Jeffrey O. Shallit; Ming-wei Wang (J. Comput. Syst. Sci., 2002)

Distances between languages and reflexivity of relations. - Christian Choffrut; Giovanni Pighizzini (Theor. Comput. Sci., 2002)

The World of Unary Languages: A Quick Tour - Carlo Mereghetti; Giovanni Pighizzini (Grammars and Automata for String Processing, 2003)

Converting two-way nondeterministic unary automata into simpler automata. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (Theor. Comput. Sci., 2003)

Complementing unary nondeterministic automata. - Filippo Mera; Giovanni Pighizzini (Theor. Comput. Sci., 2005)

String distances and intrusion detection: Bridging the gap between formal languages and computer security. - Danilo Bruschi; Giovanni Pighizzini (RAIRO Theor. Informatics Appl., 2006)

Complementing two-way finite automata. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (Inf. Comput., 2007)

A Pumping Condition for Ultralinear Languages. - Enzo Magalini; Giovanni Pighizzini (Int. J. Found. Comput. Sci., 2007)

Editorial. - Giovanni Pighizzini; Detlef Wotschke (J. Autom. Lang. Comb., 2007)

Preface. - Hing Leung; Giovanni Pighizzini (Theor. Comput. Sci., 2007)

Preface. - Viliam Geffert; Giovanni Pighizzini (Int. J. Found. Comput. Sci., 2008)

Converting Self-verifying Automata into Deterministic Automata. - Galina Jirásková; Giovanni Pighizzini (LATA, 2009)

One Pebble Versus log(n) Bits. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (NCMA, 2009)

Automata and Reduced Words in the Free Group - Thomas Ang; Giovanni Pighizzini; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2009)

Deterministic Pushdown Automata and Unary Languages. - Giovanni Pighizzini (Int. J. Found. Comput. Sci., 2009)

Nondeterministic One-Tape Off-Line Turing Machines and Their Time Complexity. - Giovanni Pighizzini (J. Autom. Lang. Comb., 2009)

Preface. - Cezar Câmpeanu; Giovanni Pighizzini (Theor. Comput. Sci., 2009)

Probabilistic vs. Nondeterministic Unary Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (NCMA, 2010)

One Pebble Versus epsilon * log n Bits. - Viliam Geffert; Giovanni Pighizzini; Carlo Mereghetti (Fundam. Informaticae, 2010)

Editorial. - Jürgen Dassow; Giovanni Pighizzini; Bianca Truthe (J. Autom. Lang. Comb., 2010)

On the Size of Unary Probabilistic and Nondeterministic Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (Fundam. Informaticae, 2011)

Two-way unary automata versus logarithmic space. - Viliam Geffert; Giovanni Pighizzini (Inf. Comput., 2011)

Optimal simulation of self-verifying automata by deterministic automata. - Galina Jirásková; Giovanni Pighizzini (Inf. Comput., 2011)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Giovanni Pighizzini (DCFS, 2012)

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)

Reversal Hierarchies for Small 2DFAs. - Christos A. Kapoutsis; Giovanni Pighizzini (MFCS, 2012)

Recent Results Around the Sakoda and Sipser Question. - Giovanni Pighizzini (NCMA, 2012)

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

Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. - Viliam Geffert; Giovanni Pighizzini (Algorithmica, 2012)

Preface. - Ian McQuillan; Giovanni Pighizzini (Int. J. Found. Comput. Sci., 2012)

Normal forms for unary probabilistic automata. - Maria Paola Bianchi; Giovanni Pighizzini (RAIRO Theor. Informatics Appl., 2012)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (J. Autom. Lang. Comb., 2012)

Preface. - Markus Holzer 001; Martin Kutrib; Giovanni Pighizzini (Theor. Comput. Sci., 2012)

Recent Trends in Descriptional Complexity of Formal Languages. - Martin Kutrib; Giovanni Pighizzini (Bull. EATCS, 2013)

Two-Way Finite Automata: Old and Recent Results. - Giovanni Pighizzini (Fundam. Informaticae, 2013)

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)

Descriptional complexity of bounded context-free languages. - Andreas Malcher; Giovanni Pighizzini (Inf. Comput., 2013)

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

Two-way automata making choices only at the endmarkers. - Viliam Geffert; Bruno Guillon; Giovanni Pighizzini (Inf. Comput., 2014)

Oblivious two-way finite automata: Decidability and complexity. - Martin Kutrib; Andreas Malcher; Giovanni Pighizzini (Inf. Comput., 2014)

Limited Automata and Regular Languages. - Giovanni Pighizzini; Andrea Pisoni (Int. J. Found. Comput. Sci., 2014)

Universal Disjunctive Concatenation and Star. - Nelma Moreira; Giovanni Pighizzini; Rogério Reis (DCFS, 2015)

One-Tape Turing Machine Variants and Language Recognition. - Giovanni Pighizzini (CoRR, 2015)

Limited Automata and Context-Free Languages. - Giovanni Pighizzini; Andrea Pisoni (Fundam. Informaticae, 2015)

Investigations on Automata and Languages Over a Unary Alphabet. - Giovanni Pighizzini (Int. J. Found. Comput. Sci., 2015)

Two-Way Automata Characterizations of L/poly Versus NL. - Christos A. Kapoutsis; Giovanni Pighizzini (Theory Comput. Syst., 2015)

Guest Column: One-Tape Turing Machine Variants and Language Recognition. - Giovanni Pighizzini (SIGACT News, 2015)

Restricted Turing Machines and Language Recognition. - Giovanni Pighizzini (LATA, 2016)

Strongly Limited Automata. - Giovanni Pighizzini (Fundam. Informaticae, 2016)

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

Preface. - Cezar Câmpeanu; Florin Manea; Giovanni Pighizzini; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2017)

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

Alberto Bertoni: A scientist and a friend. - Paola Campadelli; Massimiliano Goldwurm; Giovanni Pighizzini (Theor. Comput. Sci., 2017)

Preface. - Paola Campadelli; Giovanni Pighizzini; Massimiliano Goldwurm (Theor. Comput. Sci., 2017)

Optimal state reductions of automata with partially specified behaviors. - Nelma Moreira; Giovanni Pighizzini; Rogério Reis (Theor. Comput. Sci., 2017)

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (DLT, 2018)

Descriptional complexity of limited automata. - Martin Kutrib; Giovanni Pighizzini; Matthias Wendlandt (Inf. Comput., 2018)

Limited Automata: Properties, Complexity and Variants. - Giovanni Pighizzini (DCFS, 2019)

Limited Automata: Power and Complexity (text not included). - Giovanni Pighizzini (ICTCS, 2019)

Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract. - Giovanni Pighizzini; Luca Prigioniero (ICTCS, 2019)

Limited automata and unary languages. - Giovanni Pighizzini; Luca Prigioniero (Inf. Comput., 2019)

Special section on Descriptional Complexity of Formal Systems. - Stavros Konstantinidis; Giovanni Pighizzini (Theor. Comput. Sci., 2019)

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2020)

Preface. - Michal Hospodár; Galina Jirásková; Giovanni Pighizzini (J. Autom. Lang. Comb., 2020)

Usefulness of Information and Unary Languages. - Giovanni Pighizzini; Branislav Rovan; Simon Sádovský (LATA, 2021)

Preface to Martin Kutrib Festschrift. - Henning Fernau; Andreas Malcher; Giovanni Pighizzini (Acta Informatica, 2021)

Non-Self-Embedding Grammars and Descriptional Complexity. - Giovanni Pighizzini; Luca Prigioniero (Fundam. Informaticae, 2021)

Hot Current Topics of Descriptional Complexity. - Martin Kutrib; Nelma Moreira; Giovanni Pighizzini; Rogério Reis (IFIP's Exciting First 60+ Years, 2021)

Converting nondeterministic two-way automata into small deterministic linear-time machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2022)

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

1-Limited Automata: Witness Languages and Techniques. - Giovanni Pighizzini; Luca Prigioniero; Simon Sádovský (J. Autom. Lang. Comb., 2022)

Two-Way Machines and de Bruijn Words. - Giovanni Pighizzini; Luca Prigioniero (CIAA, 2023)

Forgetting 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero (NCMA, 2023)

Once-Marking and Always-Marking 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero (AFL, 2023)

25 Editions of DCFS: Origins and Directions. - Jürgen Dassow; Martin Kutrib; Giovanni Pighizzini (Bull. EATCS, 2023)

Preface. - Galina Jirásková; Giovanni Pighizzini (J. Autom. Lang. Comb., 2023)

Pushdown automata and constant height: decidability and bounds. - Giovanni Pighizzini; Luca Prigioniero (Acta Informatica, 2023)

Weight-reducing Turing machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2023)

Usefulness of information and decomposability of unary regular languages. - Giovanni Pighizzini; Branislav Rovan; Simon Sádovský (Inf. Comput., 2023)

Push Complexity: Optimal Bounds and Unary Inputs. - Giovanni Pighizzini (CIAA, 2024)

Performing Regular Operations with 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero; Simon Sádovský (Theory Comput. Syst., 2024)

Turn Complexity of Context-Free Languages, Pushdown andOne-Counter Automata. - Giovanni Pighizzini (DLT, 2025)

Two-Way Automata and Bounded Languages. - Alessandro Clerici Lorenzini; Giovanni Pighizzini; Luca Prigioniero (CIAA, 2025)

Pushdown and one-counter automata: Constant and non-constant memory usage. - Giovanni Pighizzini; Luca Prigioniero (Inf. Comput., 2025)