Giovanni Pighizzini
Orcid: 0000-0002-7509-7842Affiliations:
- University of Milan, Italy
According to our database1,
Giovanni Pighizzini
authored at least 104 papers
between 1988 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Acta Informatica, June, 2023
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023
Proceedings of the Implementation and Application of Automata, 2023
Proceedings of the Descriptional Complexity of Formal Systems, 2023
2022
Int. J. Found. Comput. Sci., 2022
Converting nondeterministic two-way automata into small deterministic linear-time machines.
Inf. Comput., 2022
Proceedings of the Developments in Language Theory - 26th International Conference, 2022
2021
Proceedings of the Advancing Research in Information and Communication Technology, 2021
Proceedings of the Language and Automata Theory and Applications, 2021
2020
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.
Int. J. Found. Comput. Sci., 2020
2019
Theor. Comput. Sci., 2019
Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019
Limited Automata: Power and Complexity (text not included).
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019
Proceedings of the Descriptional Complexity of Formal Systems, 2019
2018
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
2017
Theor. Comput. Sci., 2017
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017
2016
Proceedings of the Language and Automata Theory and Applications, 2016
2015
SIGACT News, 2015
Int. J. Found. Comput. Sci., 2015
Proceedings of the Descriptional Complexity of Formal Systems, 2015
2014
Proceedings of the Descriptional Complexity of Formal Systems, 2014
2013
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata.
Inf. Comput., 2013
2012
J. Autom. Lang. Comb., 2012
Algorithmica, 2012
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012
Recent Results Around the Sakoda and Sipser Question.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012
Proceedings of the Descriptional Complexity of Formal Systems, 2012
2011
Inf. Comput., 2011
Fundam. Informaticae, 2011
2010
Probabilistic vs. Nondeterministic Unary Automata.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010
2009
J. Autom. Lang. Comb., 2009
Int. J. Found. Comput. Sci., 2009
One Pebble Versus log(n) Bits.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
Proceedings of the Language and Automata Theory and Applications, 2009
2008
2007
2006
String distances and intrusion detection: Bridging the gap between formal languages and computer security.
RAIRO Theor. Informatics Appl., 2006
2005
2003
Theor. Comput. Sci., 2003
The World of Unary Languages: A Quick Tour
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003
2002
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.
J. Comput. Syst. Sci., 2002
Int. J. Found. Comput. Sci., 2002
2001
Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata.
J. Autom. Lang. Comb., 2001
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
RAIRO Theor. Informatics Appl., 2001
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001
2000
Proceedings of the Implementation and Application of Automata, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1998
1996
1995
Inf. Process. Lett., 1995
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
1994
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Inf. Comput., February, 1994
Theor. Comput. Sci., 1994
Inf. Process. Lett., 1994
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
1993
1992
Recognizing sets of labelled acyclic graphs.
Proceedings of the Tree Automata and Languages., 1992
1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
1988
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.
Proceedings of the STACS 88, 1988