About

I am a postdoctoral researcher at the Department of Computer Science of University of Milan.
I received my Ph.D. in 2020 from University of MilanDepartment of Computer Science, where I was advised by Giovanni Pighizzini. From October 2019 to February 2020 I joined the research team at the Institut für Informatik of University of Gießen. There I’ve been working as a research fellow, supervised by Martin Kutrib and Markus Holzer.

Research Activity

My research interests include formal languages, automata theory and theoretical computer science.
In particular, I am investigating computational models characterizing the class of the regular languages and having succinct descriptions. On the other hand my research activity focuses on the study of reversible formal models (from the descriptional complexity point of view) and their computations.

Teaching Activity

In 2020 I’ll be teaching the course Formal Language Theory, jointly with professor Giovanni Pighizzini.

Attended and Upcoming Events

Conferences and Workshops

  • DLT 2020, May 11–13 2020, Tampa (FL) — USA
  • RPLA 2019, October 9 2019, Porto — Portugal
  • ICTCS 2019, September 9–11 2019, Como — Italy
  • DCFS 2019, July 17–19 2019, Košice — Slovakia
  • ICTCS 2018, September 18–20 2018, Urbino — Italy
  • DLT 2018, September 10–14 2017, Tokyo — Japan
  • CIAA 2018, July 29 – August 2 2018, Charlottetown (PEI) — Canada
  • DCFS 2018, July 25–27 2018, Halifax (NS) — Canada
  • AFL 2017, September 4–6 2017, Debrecen — Hungary
  • NCMA 2017, August 17–18 2017, Prague — Czech Republic
  • DLT 2017, August 7–11 2017, Liège — Belgium
  • DCFS 2017, July 3–5 2017, Milan — Italy
  • ICTCS 2016, September 7–9 2016, Lecce — Italy
  • DCFS 2016, July 5–8 2016, Bucharest — Romania
  • MFCS 2015, August 24–28 2015, Milan — Italy

Schools

Scientific Visits

Publications

Journal papers

  1. Giovanna J. Lavado and Luca Prigioniero:
    Concise Representations of Reversible Automata
    International Journal of Foundations of Computer Science, 30(6-7), pp. 1157–1175, 2019.
  2. Bruno Guillon and Luca Prigioniero:
    Linear-time limited automata
    Theoretical Computer Science, 798 pp. 95–108, 2019.
  3. Giovanni Pighizzini and Luca Prigioniero:
    Limited automata and unary languages
    Information and Computation, 266 pp. 60–74, 2019.
  4. Giovanna J. Lavado, Giovanni Pighizzini, and Luca Prigioniero:
    Minimal and Reduced Reversible Automata
    Journal of Automata, Languages and Combinatorics, 22(1-3), pp. 145–168, 2017.

Conference papers

  1. Giovanni Pighizzini and Luca Prigioniero:
    Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract
    In Proceedings of ICTCS 2019
    CEUR Workshop Proceedings 2504, pp. 72–77, 2019.
  2. Giovanni Pighizzini and Luca Prigioniero:
    Pushdown Automata and Constant Height: Decidability and Bounds
    In Proceedings of DCFS 2019
    Lecture Notes in Computer Science 11612, pp. 260–271, 2019.
  3. Bruno Guillon and Luca Prigioniero:
    Linear-Time Limited Automata
    In Proceedings of DCFS 2018
    Lecture Notes in Computer Science 10952, pp. 126–138, 2018.
  4. Bruno Guillon, Martin Kutrib, Andreas Malcher, and Luca Prigioniero:
    Reversible Pushdown Transducers
    In Proceedings of DLT 2018
    Lecture Notes in Computer Science 11088, pp. 354–365, 2018.
  5. Bruno Guillon, Giovanni Pighizzini, and Luca Prigioniero:
    On Some Succinct Representations of Regular Languages - Extended Abstract
    In Proceedings of ICTCS 2018
    CEUR Workshop Proceedings 2243, pp. 203–207, 2018.
  6. Bruno Guillon and Luca Prigioniero:
    Linear-Time Limited Automata - Extended Abstract
    In Proceedings of ICTCS 2018
    CEUR Workshop Proceedings 2243, pp. 208–212, 2018.
  7. Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, and Daniel Průša:
    Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time
    In Proceedings of DLT 2018
    Lecture Notes in Computer Science 11088, pp. 366–378, 2018.
  8. Bruno Guillon, Giovanni Pighizzini, and Luca Prigioniero:
    Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata
    In Proceedings of CIAA 2018
    Lecture Notes in Computer Science 10977, pp. 186–197, 2018.
  9. Giovanna J. Lavado and Luca Prigioniero:
    Concise Representations of Reversible Automata
    In Proceedings of DCFS 2017
    Lecture Notes in Computer Science 10316, pp. 238–249, 2017.
  10. Giovanni Pighizzini and Luca Prigioniero:
    Limited Automata and Unary Languages
    In Proceedings of DLT 2017
    Lecture Notes in Computer Science 10396, pp. 308–319, 2017.
  11. Giovanna J. Lavado, Giovanni Pighizzini, and Luca Prigioniero:
    Weakly and Strongly Irreversible Regular Languages
    In Proceedings of AFL 2017
    EPTCS 252, pp. 143–156, 2017.
  12. Giovanni Pighizzini and Luca Prigioniero:
    Non-self-embedding grammars and descriptional complexity
    In Proceedings of NCMA 2017, pp. 197–209, 2017.
  13. Giovanna J. Lavado, Giovanni Pighizzini, and Luca Prigioniero:
    Minimal and Reduced Reversible Automata
    In Proceedings of DCFS 2016
    Lecture Notes in Computer Science 9777, pp. 168–179, 2016.
  14. Giovanna J. Lavado, Giovanni Pighizzini, and Luca Prigioniero:
    Minimal and Reduced Reversible Automata
    In Proceedings of ICTCS 2016
    CEUR Workshop Proceedings 1720, pp. 234–239, 2016.