Talks

  • Insiemi Indipendenti di Famiglie di Grafi tramite Automi a Stati Finiti.
    Università degli Studi di Milano, January 13, 2017.
    [slides]
  • Minimal and Reduced Reversible Automata.
    ICTCS 2016 – 17th Italian Conference on Theoretical Computer Science.
    Università del Salento, September 7-9, 2016.
    [slides] [abstract]
  • Minimal and Reduced Reversible Automata.
    DCFS 2016 – 18th International Workshop on Descriptional Complexity of Formal Systems.
    University of Bucharest, July 5-8, 2016.
    [slides]
  • Minimal and Reduced Reversible Automata.
    Università degli Studi di Milano, June 17, 2016.
    [slides]
  • Insiemi Stabili di Famiglie di Grafi tramite Automi a Stati Finiti.
    Università degli Studi di Milano, January 15, 2016.
    [slides]
  • Descriptional Complexity and Parikh Equivalence.
    Università degli Studi di Milano, March 13, 2015.
    [slides]
  • Descriptional Complexity under Parikh Equivalence.
    Università degli Studi di Milano, January 22, 2015.
    [slides]
  • Operational State Complexity under Parikh Equivalence.
    ICTCS 2014 – 15th Italian Conference on Theoretical Computer Science.
    Università degli Studi di Perugia, September 17-19, 2014.
    [slides] [abstract]
  • Descriptional Complexity and Parikh Equivalence.
    Workshop PRIN 2010-2011 Automi e Linguaggi Formali: Aspetti Matematici e Applicativi.
    Politecnico di Milano, November 28-29, 2013.
    [slides]
  • Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
    ICTCS 2012 – 13th Italian Conference on Theoretical Computer Science.
    Università degli Studi dell’Insubria, September 19-21, 2012.
    [slides] [abstract]

Postdoctoral Researcher in Computer Science