Journal Articles

Pighizzini, G and Prigioniero, L (2023) Pushdown automata and constant height: decidability and bounds, Acta Informatica, 60(2), pp.123-144, ISSN: 0001-5903. DOI: 10.1007/s00236-022-00434-0.

Guillon, B, Pighizzini, G, Prigioniero, L, Průša, D (2023) Weight-reducing Turing machines, Information and Computation, 292, pp.105030-105030, ISSN: 0890-5401. DOI: 10.1016/j.ic.2023.105030.

Guillon, B, Pighizzini, G, Prigioniero, L, Průša, D (2022) Converting nondeterministic two-way automata into small deterministic linear-time machines, Information and Computation, 289, pp.104938-104938, ISSN: 0890-5401. DOI: 10.1016/j.ic.2022.104938.

Guillon, B, Lavado, GJ, Pighizzini, G, Prigioniero, L (2022) Weakly and Strongly Irreversible Regular Languages, International Journal of Foundations of Computer Science, 33(03n04), pp.263-284, ISSN: 0129-0541. DOI: 10.1142/s0129054122410052.

Pighizzini, G, Prigioniero, L, Sádovský, Š (2022) 1-LIMITED AUTOMATA: WITNESS LANGUAGES AND TECHNIQUES, Journal of Automata, Languages and Combinatorics, 27(1-3), pp.229-244, ISSN: 1430-189X. DOI: 10.25596/jalc-2022-229.

Guillon, B, Kutrib, M, Malcher, A, Prigioniero, L (2021) Reversible pushdown transducers, Information and Computation, 281, pp.104813-104813, ISSN: 0890-5401. DOI: 10.1016/j.ic.2021.104813.

Ibarra, OH, Jirásek, J, McQuillan, I, Prigioniero, L (2021) Space Complexity of Stack Automata Models, International Journal of Foundations of Computer Science, 32(06), pp.801-823, ISSN: 0129-0541. DOI: 10.1142/s0129054121420090.

Pighizzini, G and Prigioniero, L (2021) Non-Self-Embedding Grammars and Descriptional Complexity, Fundamenta Informaticae, 180(1-2), pp.103-122, ISSN: 0169-2968. DOI: 10.3233/fi-2021-2036.

Guillon, B and Prigioniero, L (2019) Linear-time limited automata, Theoretical Computer Science, 798, pp.95-108, ISSN: 0304-3975. DOI: 10.1016/j.tcs.2019.03.037.

Lavado, GJ and Prigioniero, L (2019) Concise Representations of Reversible Automata, International Journal of Foundations of Computer Science, 30(06n07), pp.1157-1175, ISSN: 0129-0541. DOI: 10.1142/s0129054119400331.

Pighizzini, G and Prigioniero, L (2019) Limited automata and unary languages, Information and Computation, 266, pp.60-74, ISSN: 0890-5401. DOI: 10.1016/j.ic.2019.01.002.

Pighizzini, G and Prigioniero, L (2017) Limited Automata and Unary Languages, pp.308-319, ISSN: 0302-9743. DOI: 10.1007/978-3-319-62809-7_23.

Conferences

Pighizzini, G and Prigioniero, L (2023) Forgetting 1-limited automata. In Nagy, B and Freund, R (ed) 13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023); Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, Famagusta, North Cyprus, pp.95-109, DOI: 10.4204/EPTCS.388.10.

Pighizzini, G and Prigioniero, L (2023) Once-marking and always-marking 1-limited automata. In Gazdag, Z, Iván, S, Kovásznai, G (ed) 16th International Conference on Automata and Formal Languages (AFL 2023); Proceedings of the 16th International Conference on Automata and Formal Languages, Eger, Hungary, pp.215-227, DOI: 10.4204/EPTCS.386.17.

Pighizzini, G, Prigioniero, L, Sádovský, Š (2022) Performing Regular Operations with 1-Limited Automata. In , pp.239-250, ISBN: 9783031055775. DOI: 10.1007/978-3-031-05578-2_19.

Prigioniero, L (2021) Regular languages: To finite automata and beyond succinct descriptions and optimal simulations. In , OpenAccess Series in Informatics,ISBN: 9783959771894. DOI: 10.4230/OASIcs.AUTOMATA.2021.2.

Kutrib, M and Prigioniero, L (2021) Boolean Kernels of Context-Free Languages. In , pp.152-164, ISBN: 9783030791209. DOI: 10.1007/978-3-030-79121-6_13.

Guillon, B, Pighizzini, G, Prigioniero, L (2020) Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. In , International Journal of Foundations of Computer Science, pp.1133-1157, DOI: 10.1142/s0129054120420071.

Ibarra, OH, Jirásek, J, McQuillan, I, Prigioniero, L (2020) Space Complexity of Stack Automata Models. In , pp.137-149, ISBN: 9783030485153. DOI: 10.1007/978-3-030-48516-0_11.

Aman, B, Ciobanu, G, Glück, R, Kaarsgaard, R, Kari, J, Kutrib, M, Lanese, I, Mezzina, CA, Mikulski, Ł, Nagarajan, R, Phillips, I, Pinna, GM, Prigioniero, L, Ulidowski, I, Vidal, G (2020) Foundations of Reversible Computation. In , pp.1-40, ISBN: 9783030473600. DOI: 10.1007/978-3-030-47361-7_1.

Pighizzini, G and Prigioniero, L (2019) Pushdown automata and constant height: Decidability and bounds: Extended abstract. In , CEUR Workshop Proceedings, pp.72-77.

Pighizzini, G and Prigioniero, L (2019) Pushdown Automata and Constant Height: Decidability and Bounds. In , pp.260-271, ISBN: 9783030232467. DOI: 10.1007/978-3-030-23247-4_20.

Guillon, B and Prigioniero, L (2018) Linear-Time Limited Automata. In , pp.126-138, ISBN: 9783319946306. DOI: 10.1007/978-3-319-94631-3_11.

Guillon, B and Prigioniero, L (2018) Linear-time limited automata extended abstract. In , CEUR Workshop Proceedings, pp.208-212.

Guillon, B, Pighizzini, G, Prigioniero, L (2018) On some succinct representations of regular languages extended abstract. In , CEUR Workshop Proceedings, pp.203-207.

Guillon, B, Pighizzini, G, Prigioniero, L, Průša, D (2018) Two-Way Automata and One-Tape Machines: Read Only Versus Linear Time. In , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp.366-378, ISBN: 9783319986531. DOI: 10.1007/978-3-319-98654-8_30.

Guillon, B, Kutrib, M, Malcher, A, Prigioniero, L (2018) Reversible Pushdown Transducers. In , pp.354-365, ISBN: 9783319986531. DOI: 10.1007/978-3-319-98654-8_29.

Guillon, B, Pighizzini, G, Prigioniero, L (2018) Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. In , pp.186-197, ISBN: 9783319948119. DOI: 10.1007/978-3-319-94812-6_16.

Lavado, GJ, Pighizzini, G, Prigioniero, L (2017) Weakly and Strongly Irreversible Regular Languages. In , Electronic Proceedings in Theoretical Computer Science, pp.143-156, DOI: 10.4204/eptcs.252.15.

Lavado, GJ and Prigioniero, L (2017) Concise Representations of Reversible Automata. In , pp.238-249, ISBN: 9783319602516. DOI: 10.1007/978-3-319-60252-3_19.

Lavado, GJ, Pighizzini, G, Prigioniero, L (2016) Minimal and reduced reversible automata. In , CEUR Workshop Proceedings, pp.234-239.

Chapters

Pighizzini, G and Prigioniero, L (2023) Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage. In Descriptional Complexity of Formal Systems, Springer Nature Switzerland, pp.146-157, ISBN: 9783031343254. DOI: 10.1007/978-3-031-34326-1_11.

Pighizzini, G and Prigioniero, L (2023) Two-Way Machines and de Bruijn Words. In Implementation and Application of Automata, Springer Nature Switzerland, pp.254-265, ISBN: 9783031402463. DOI: 10.1007/978-3-031-40247-0_19.

Kreczman, S, Prigioniero, L, Rowland, E, Stipulanti, M (2023) Magic Numbers in Periodic Sequences. In Lecture Notes in Computer Science, Springer Nature Switzerland, pp.206-219, ISBN: 9783031331794. DOI: 10.1007/978-3-031-33180-0_16.

Guillon, B, Pighizzini, G, Prigioniero, L, Průša, D (2018) Two-Way Automata and One-Tape Machines. In Developments in Language Theory, Springer International Publishing, pp.366-378, ISBN: 9783319986531. DOI: 10.1007/978-3-319-98654-8_30.

Lavado, GJ, Pighizzini, G, Prigioniero, L (2016) Minimal and Reduced Reversible Automata. In Descriptional Complexity of Formal Systems, Springer International Publishing, pp.168-179, ISBN: 9783319411132. DOI: 10.1007/978-3-319-41114-9_13.