Publications

  • Minimal and Reduced Reversible Automata.
    Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero.
    18th International Workshop on Descriptional Complexity of Formal Systems – DCFS 2016.
    Bucharest, Romania, July 5-8 , 2016, proceedings LNCS Vol. 9777.
  • Operational State Complexity under Parikh Equivalence.
    Giovanna J. Lavado, Giovanni Pighizzini and Shinnosuke Seki.
    16th International Workshop on Descriptional Complexity of Formal Systems – DCFS 2014.
    Turku, Finland, August 5-8, 2014, proceedings LNCS Vol. 8614.
  • Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata.
    Giovanna J. Lavado, Giovanni Pighizzini and Shinnosuke Seki.
    Information and Computation journal. Volumes 228-229, July 2013, Pages 1-15.
  • Converting Nondeterministic Automata and Context-free Grammars into Parikh Equivalent Deterministic Automata.
    Giovanna J. Lavado, Giovanni Pighizzini and Shinnosuke Seki.
    16th International Conference on Developments in Language Theory – DLT 2012.
    Taipei, Taiwan, August 14-17, 2012, proceedings LNCS Vol. 7410.
  • Parikh’s Theorem and Descriptional Complexity.
    Giovanna J. Lavado and Giovanni Pighizzini.
    38th International Conference on Current Trends in Theory and Practice of Computer Science – SOFSEM 2012.
    Czech Republic, January 21-27, 2012, proceedings LNCS Vol. 7147.

Postdoctoral Researcher in Computer Science