Giovanni Pighizzini

161 papers A 2B 13C 19Misc 1Journal 85Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Push complexity: Optimal bounds and decidability. Theor. Comput. Sci. Giovanni Pighizzini
2026	J	`jnl`	Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata. CoRR Giovanni Pighizzini
2025	J	`jnl`	Pushdown and one-counter automata: Constant and non-constant memory usage. Inf. Comput. Giovanni Pighizzini, Luca Prigioniero
2025	C	`conf`	Turn Complexity of Context-Free Languages, Pushdown andOne-Counter Automata. DLT Giovanni Pighizzini
2025	C	`conf`	Two-Way Automata and Bounded Languages. CIAA Alessandro Clerici Lorenzini, Giovanni Pighizzini, Luca Prigioniero
2024	J	`jnl`	Performing Regular Operations with 1-Limited Automata. Theory Comput. Syst. Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský
2024	—	`ed.`	Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), NCMA 2024, Göttingen, Germany, 12-13 August 2024. NCMA Florin Manea, Giovanni Pighizzini
2024	C	`conf`	Push Complexity: Optimal Bounds and Unary Inputs. CIAA Giovanni Pighizzini
2023	J	`jnl`	25 Editions of DCFS: Origins and Directions. Bull. EATCS Jürgen Dassow, Martin Kutrib, Giovanni Pighizzini
2023	—	`conf`	Forgetting 1-Limited Automata. NCMA Giovanni Pighizzini, Luca Prigioniero
2023	—	`conf`	Once-Marking and Always-Marking 1-Limited Automata. AFL Giovanni Pighizzini, Luca Prigioniero
2023	J	`jnl`	Preface. J. Autom. Lang. Comb. Galina Jirásková, Giovanni Pighizzini
2023	—	`conf`	Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage. DCFS Giovanni Pighizzini, Luca Prigioniero
2023	J	`jnl`	Pushdown automata and constant height: decidability and bounds. Acta Informatica Giovanni Pighizzini, Luca Prigioniero
2023	C	`conf`	Two-Way Machines and de Bruijn Words. CIAA Giovanni Pighizzini, Luca Prigioniero
2023	J	`jnl`	Usefulness of information and decomposability of unary regular languages. Inf. Comput. Giovanni Pighizzini, Branislav Rovan, Simon Sádovský
2023	J	`jnl`	Weight-reducing Turing machines. Inf. Comput. Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
2022	J	`jnl`	1-Limited Automata: Witness Languages and Techniques. J. Autom. Lang. Comb. Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský
2022	J	`jnl`	Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
2022	C	`conf`	Performing Regular Operations with 1-Limited Automata. DLT Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský
2022	J	`jnl`	Weakly and Strongly Irreversible Regular Languages. Int. J. Found. Comput. Sci. Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2021	J	`jnl`	Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines. CoRR Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
2021	—	`ch.`	Hot Current Topics of Descriptional Complexity. IFIP's Exciting First 60+ Years Martin Kutrib, Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2021	J	`jnl`	Non-Self-Embedding Grammars and Descriptional Complexity. Fundam. Informaticae Giovanni Pighizzini, Luca Prigioniero
2021	J	`jnl`	Preface to Martin Kutrib Festschrift. Acta Informatica Henning Fernau, Andreas Malcher, Giovanni Pighizzini
2021	C	`conf`	Usefulness of Information and Unary Languages. LATA Giovanni Pighizzini, Branislav Rovan, Simon Sádovský
2021	J	`jnl`	Weight-Reducing Turing Machines. CoRR Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
2020	—	`ed.`	Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings DCFS Galina Jirásková, Giovanni Pighizzini
2020	J	`jnl`	Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. Int. J. Found. Comput. Sci. Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
2020	J	`jnl`	Preface. J. Autom. Lang. Comb. Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2019	—	`conf`	Limited Automata: Power and Complexity (text not included). ICTCS Giovanni Pighizzini
2019	—	`conf`	Limited Automata: Properties, Complexity and Variants. DCFS Giovanni Pighizzini
2019	J	`jnl`	Limited automata and unary languages. Inf. Comput. Giovanni Pighizzini, Luca Prigioniero
2019	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Cezar Câmpeanu, Giovanni Pighizzini
2019	—	`conf`	Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract. ICTCS Giovanni Pighizzini, Luca Prigioniero
2019	—	`conf`	Pushdown Automata and Constant Height: Decidability and Bounds. DCFS Giovanni Pighizzini, Luca Prigioniero
2019	B	`ed.`	SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings SOFSEM Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini
2019	J	`jnl`	Special section on Descriptional Complexity of Formal Systems. Theor. Comput. Sci. Stavros Konstantinidis, Giovanni Pighizzini
2018	—	`ed.`	Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings DCFS Stavros Konstantinidis, Giovanni Pighizzini
2018	J	`jnl`	Descriptional complexity of limited automata. Inf. Comput. Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt
2018	C	`conf`	Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. CIAA Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
2018	—	`ed.`	Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. NCMA Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2018	C	`conf`	Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
2017	J	`jnl`	Alberto Bertoni: A scientist and a friend. Theor. Comput. Sci. Paola Campadelli, Massimiliano Goldwurm, Giovanni Pighizzini
2017	—	`ed.`	Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings DCFS Giovanni Pighizzini, Cezar Câmpeanu
2017	C	`conf`	Limited Automata and Unary Languages. DLT Giovanni Pighizzini, Luca Prigioniero
2017	J	`jnl`	Minimal and Reduced Reversible Automata. J. Autom. Lang. Comb. Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2017	—	`conf`	Non-self-embedding grammars and descriptional complexity. NCMA Giovanni Pighizzini, Luca Prigioniero
2017	J	`jnl`	Optimal state reductions of automata with partially specified behaviors. Theor. Comput. Sci. Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2017	J	`jnl`	Preface. J. Autom. Lang. Comb. Cezar Câmpeanu, Florin Manea, Giovanni Pighizzini, Jeffrey O. Shallit
2017	J	`jnl`	Preface. Theor. Comput. Sci. Paola Campadelli, Giovanni Pighizzini, Massimiliano Goldwurm
2017	—	`conf`	Weakly and Strongly Irreversible Regular Languages. AFL Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2016	—	`conf`	Minimal and Reduced Reversible Automata. DCFS Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2016	—	`conf`	Minimal and Reduced Reversible Automata. ICTCS Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2016	J	`jnl`	Minimal and Reduced Reversible Automata. CoRR Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
2016	C	`conf`	Restricted Turing Machines and Language Recognition. LATA Giovanni Pighizzini
2016	J	`jnl`	Strongly Limited Automata. Fundam. Informaticae Giovanni Pighizzini
2015	J	`jnl`	Guest Column: One-Tape Turing Machine Variants and Language Recognition. SIGACT News Giovanni Pighizzini
2015	J	`jnl`	Investigations on Automata and Languages Over a Unary Alphabet. Int. J. Found. Comput. Sci. Giovanni Pighizzini
2015	J	`jnl`	Limited Automata and Context-Free Languages. Fundam. Informaticae Giovanni Pighizzini, Andrea Pisoni
2015	—	`ed.`	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I MFCS (1) Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella
2015	—	`ed.`	Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II MFCS (2) Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella
2015	J	`jnl`	One-Tape Turing Machine Variants and Language Recognition. CoRR Giovanni Pighizzini
2015	B	`conf`	Optimal State Reductions of Automata with Partially Specified Behaviors. SOFSEM Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2015	J	`jnl`	Two-Way Automata Characterizations of L/poly Versus NL. Theory Comput. Syst. Christos A. Kapoutsis, Giovanni Pighizzini
2015	—	`conf`	Universal Disjunctive Concatenation and Star. DCFS Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2014	C	`conf`	Investigations on Automata and Languages over a Unary Alphabet. CIAA Giovanni Pighizzini
2014	J	`jnl`	Limited Automata and Regular Languages. Int. J. Found. Comput. Sci. Giovanni Pighizzini, Andrea Pisoni
2014	J	`jnl`	Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2014	—	`conf`	Operational State Complexity under Parikh Equivalence. DCFS Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
2014	—	`conf`	Strongly limited automata. NCMA Giovanni Pighizzini
2014	J	`jnl`	Two-way automata making choices only at the endmarkers. Inf. Comput. Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2013	J	`jnl`	Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput. Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
2013	J	`jnl`	Descriptional complexity of bounded context-free languages. Inf. Comput. Andreas Malcher, Giovanni Pighizzini
2013	—	`conf`	Limited Automata and Regular Languages. DCFS Giovanni Pighizzini, Andrea Pisoni
2013	—	`conf`	Limited automata and context-free languages. NCMA Giovanni Pighizzini, Andrea Pisoni
2013	J	`jnl`	Recent Trends in Descriptional Complexity of Formal Languages. Bull. EATCS Martin Kutrib, Giovanni Pighizzini
2013	J	`jnl`	Two-Way Finite Automata: Old and Recent Results. Fundam. Informaticae Giovanni Pighizzini
2012	C	`conf`	Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata. Developments in Language Theory Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
2012	J	`jnl`	Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata CoRR Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
2012	J	`jnl`	Normal forms for unary probabilistic automata. RAIRO Theor. Informatics Appl. Maria Paola Bianchi, Giovanni Pighizzini
2012	B	`conf`	Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN Martin Kutrib, Andreas Malcher, Giovanni Pighizzini
2012	—	`conf`	On Inverse Operations and Their Descriptional Complexity. DCFS Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
2012	J	`jnl`	On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2012	J	`jnl`	Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Algorithmica Viliam Geffert, Giovanni Pighizzini
2012	B	`conf`	Parikh's Theorem and Descriptional Complexity. SOFSEM Giovanna J. Lavado, Giovanni Pighizzini
2012	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Ian McQuillan, Giovanni Pighizzini
2012	J	`jnl`	Preface. Theor. Comput. Sci. Markus Holzer, Martin Kutrib, Giovanni Pighizzini
2012	—	`conf`	Recent Results Around the Sakoda and Sipser Question. NCMA Giovanni Pighizzini
2012	B	`conf`	Reversal Hierarchies for Small 2DFAs. MFCS Christos A. Kapoutsis, Giovanni Pighizzini
2012	Misc	`conf`	Two-Way Automata Characterizations of L/poly versus NL. CSR Christos A. Kapoutsis, Giovanni Pighizzini
2012	C	`conf`	Two-Way Automata Making Choices Only at the Endmarkers. LATA Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2012	—	`conf`	Two-Way Finite Automata: Old and Recent Results DCM Giovanni Pighizzini
2011	—	`ed.`	Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings DCFS Markus Holzer, Martin Kutrib, Giovanni Pighizzini
2011	—	`conf`	Normal Forms for Unary Probabilistic Automata. NCMA Maria Paola Bianchi, Giovanni Pighizzini
2011	J	`jnl`	On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2011	J	`jnl`	Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. Galina Jirásková, Giovanni Pighizzini
2011	J	`jnl`	Two-Way Automata Making Choices Only at the Endmarkers CoRR Viliam Geffert, Bruno Guillon, Giovanni Pighizzini
2011	J	`jnl`	Two-way unary automata versus logarithmic space. Inf. Comput. Viliam Geffert, Giovanni Pighizzini
2010	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe
2010	J	`jnl`	One Pebble Versus epsilon * log n Bits. Fundam. Informaticae Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti
2010	B	`conf`	Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. LATIN Viliam Geffert, Giovanni Pighizzini
2010	—	`conf`	Probabilistic vs. Nondeterministic Unary Automata. NCMA Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2010	—	`ed.`	Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. DCFS Ian McQuillan, Giovanni Pighizzini
2010	C	`conf`	Two-Way Unary Automata versus Logarithmic Space. Developments in Language Theory Viliam Geffert, Giovanni Pighizzini
2009	J	`jnl`	Automata and Reduced Words in the Free Group CoRR Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey O. Shallit
2009	C	`conf`	Converting Self-verifying Automata into Deterministic Automata. LATA Galina Jirásková, Giovanni Pighizzini
2009	J	`jnl`	Descriptional complexity of bounded context-free languages CoRR Andreas Malcher, Giovanni Pighizzini
2009	J	`jnl`	Deterministic Pushdown Automata and Unary Languages. Int. J. Found. Comput. Sci. Giovanni Pighizzini
2009	J	`jnl`	Deterministic pushdown automata and unary languages CoRR Giovanni Pighizzini
2009	J	`jnl`	Nondeterministic One-Tape Off-Line Turing Machines and Their Time Complexity. J. Autom. Lang. Comb. Giovanni Pighizzini
2009	J	`jnl`	Nondeterministic one-tape off-line Turing machines and their time complexity CoRR Giovanni Pighizzini
2009	—	`conf`	One Pebble Versus log(n) Bits. NCMA Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2009	J	`jnl`	Preface. Theor. Comput. Sci. Cezar Câmpeanu, Giovanni Pighizzini
2009	—	`ed.`	Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009. DCFS Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe
2008	—	`ed.`	10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. DCFS Cezar Câmpeanu, Giovanni Pighizzini
2008	C	`conf`	Deterministic Pushdown Automata and Unary Languages. CIAA Giovanni Pighizzini
2008	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Viliam Geffert, Giovanni Pighizzini
2007	—	`ed.`	9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 DCFS Viliam Geffert, Giovanni Pighizzini
2007	J	`jnl`	A Pumping Condition for Ultralinear Languages. Int. J. Found. Comput. Sci. Enzo Magalini, Giovanni Pighizzini
2007	J	`jnl`	Complementing two-way finite automata. Inf. Comput. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2007	C	`conf`	Descriptional Complexity of Bounded Context-Free Languages. Developments in Language Theory Andreas Malcher, Giovanni Pighizzini
2007	J	`jnl`	Editorial. J. Autom. Lang. Comb. Giovanni Pighizzini, Detlef Wotschke
2007	J	`jnl`	Preface. Theor. Comput. Sci. Hing Leung, Giovanni Pighizzini
2006	—	`ed.`	8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings DCFS Hing Leung, Giovanni Pighizzini
2006	J	`jnl`	String distances and intrusion detection: Bridging the gap between formal languages and computer security. RAIRO Theor. Informatics Appl. Danilo Bruschi, Giovanni Pighizzini
2005	—	`ed.`	7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings DCFS Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke
2005	C	`conf`	Complementing Two-Way Finite Automata. Developments in Language Theory Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2005	J	`jnl`	Complementing unary nondeterministic automata. Theor. Comput. Sci. Filippo Mera, Giovanni Pighizzini
2003	—	`conf`	Complementing Unary Nondeterministic Automata. DCFS Filippo Mera, Giovanni Pighizzini
2003	J	`jnl`	Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2003	—	`conf`	The World of Unary Languages: A Quick Tour Grammars and Automata for String Processing Carlo Mereghetti, Giovanni Pighizzini
2002	J	`jnl`	Distances between languages and reflexivity of relations. Theor. Comput. Sci. Christian Choffrut, Giovanni Pighizzini
2002	J	`jnl`	Simulating finite automata with context-free grammars. Inf. Process. Lett. Michael Domaratzki, Giovanni Pighizzini, Jeffrey O. Shallit
2002	J	`jnl`	Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. Giovanni Pighizzini, Jeffrey O. Shallit, Ming-wei Wang
2002	J	`jnl`	Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. Giovanni Pighizzini, Jeffrey O. Shallit
2001	B	`conf`	Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
2001	J	`jnl`	How Hard Is Computing the Edit Distance? Inf. Comput. Giovanni Pighizzini
2001	J	`jnl`	Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO Theor. Informatics Appl. Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2001	—	`conf`	On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. DCFS Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2001	J	`jnl`	Optimal Simulations between Unary Automata. SIAM J. Comput. Carlo Mereghetti, Giovanni Pighizzini
2001	J	`jnl`	Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. J. Autom. Lang. Comb. Massimiliano Milani, Giovanni Pighizzini
2000	J	`jnl`	Two-Way Automata Simulations and Unary Languages. J. Autom. Lang. Comb. Carlo Mereghetti, Giovanni Pighizzini
2000	C	`conf`	Unary Language Concatenation and Its State Complexity. CIAA Giovanni Pighizzini
2000	B	`conf`	Unary Pushdown Automata and Auxiliary Space Lower Bounds. MFCS Giovanni Pighizzini
1998	A	`conf`	Optimal Simulations Between Unary Automata. STACS Carlo Mereghetti, Giovanni Pighizzini
1998	J	`jnl`	Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
1997	B	`conf`	Distances Between Languages and Reflexivity of Relations. MFCS Christian Choffrut, Giovanni Pighizzini
1996	J	`jnl`	Probabilistic Asynchronous Automata. Math. Syst. Theory S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini
1995	J	`jnl`	A Remark on Middle Space Bounded Alternating Turing Machines. Inf. Process. Lett. Carlo Mereghetti, Giovanni Pighizzini
1995	B	`conf`	How Hard is to Compute the Edit Distance. FCT Giovanni Pighizzini
1995	B	`conf`	Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. MFCS Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
1994	J	`jnl`	An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
1994	J	`jnl`	Asynchronous Automata Versus Asynchronous Cellular Automata. Theor. Comput. Sci. Giovanni Pighizzini
1994	J	`jnl`	Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
1994	B	`conf`	On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
1994	J	`jnl`	On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages Inf. Comput. Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini
1993	J	`jnl`	The Complexity of Computing Maximal Word Functions. Comput. Complex. Eric Allender, Danilo Bruschi, Giovanni Pighizzini
1992	—	`ch.`	Recognizing sets of labelled acyclic graphs. Tree Automata and Languages Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini
1991	B	`conf`	The Complexity of Computing Maximal Word Functions. FCT Danilo Bruschi, Giovanni Pighizzini
1988	A	`conf`	On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. STACS Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini