Weakly and Strongly Irreversible Regular Languages. - Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (AFL, 2017)

Minimal and Reduced Reversible Automata. - Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (J. Autom. Lang. Comb., 2017)

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (DLT, 2018)

Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract. - Giovanni Pighizzini; Luca Prigioniero (ICTCS, 2019)

Limited automata and unary languages. - Giovanni Pighizzini; Luca Prigioniero (Inf. Comput., 2019)

Concise Representations of Reversible Automata. - Giovanna J. Lavado; Luca Prigioniero (Int. J. Found. Comput. Sci., 2019)

Linear-time limited automata. - Bruno Guillon; Luca Prigioniero (Theor. Comput. Sci., 2019)

Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations. - Luca Prigioniero (Bull. EATCS, 2020)

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2020)

Regular languages: to finite automata and beyond - succinct descriptions and optimal simulations. - Luca Prigioniero (2020)

Foundations of Reversible Computation. - Bogdan Aman; Gabriel Ciobanu; Robert Glück; Robin Kaarsgaard; Jarkko Kari; Martin Kutrib; Ivan Lanese; Claudio Antares Mezzina; Lukasz Mikulski; Rajagopal Nagarajan; Iain C. C. Phillips; G. Michele Pinna; et al. (Selected Results of the COST Action IC1405, 2020)

Regular Languages: To Finite Automata and Beyond (Invited Talk). - Luca Prigioniero (AUTOMATA, 2021)

Boolean Kernels of Context-Free Languages. - Martin Kutrib; Luca Prigioniero (CIAA, 2021)

Non-Self-Embedding Grammars and Descriptional Complexity. - Giovanni Pighizzini; Luca Prigioniero (Fundam. Informaticae, 2021)

Reversible pushdown transducers. - Bruno Guillon; Martin Kutrib; Andreas Malcher; Luca Prigioniero (Inf. Comput., 2021)

Space Complexity of Stack Automata Models. - Oscar H. Ibarra; Jozef Jirásek 002; Ian McQuillan; Luca Prigioniero (Int. J. Found. Comput. Sci., 2021)

Converting nondeterministic two-way automata into small deterministic linear-time machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2022)

Weakly and Strongly Irreversible Regular Languages. - Bruno Guillon; Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2022)

1-Limited Automata: Witness Languages and Techniques. - Giovanni Pighizzini; Luca Prigioniero; Simon Sádovský (J. Autom. Lang. Comb., 2022)

Magic Numbers in Periodic Sequences. - Savinien Kreczman; Luca Prigioniero; Eric Rowland; Manon Stipulanti (WORDS, 2023)

Two-Way Machines and de Bruijn Words. - Giovanni Pighizzini; Luca Prigioniero (CIAA, 2023)

Forgetting 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero (NCMA, 2023)

Once-Marking and Always-Marking 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero (AFL, 2023)

Pushdown automata and constant height: decidability and bounds. - Giovanni Pighizzini; Luca Prigioniero (Acta Informatica, 2023)

Weight-reducing Turing machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2023)

Block Languages and Their Bitmap Representations. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (CIAA, 2024)

On the Representation of Block Languages. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (CoRR, 2024)

Operational State Complexity of Block Languages. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (NCMA, 2024)

Performing Regular Operations with 1-Limited Automata. - Giovanni Pighizzini; Luca Prigioniero; Simon Sádovský (Theory Comput. Syst., 2024)

Nondeterminism Makes Unary 1-Limited Automata Concise. - Bruno Guillon; Luca Prigioniero; Javad Taheri (DLT, 2025)

Two-Way Automata and Bounded Languages. - Alessandro Clerici Lorenzini; Giovanni Pighizzini; Luca Prigioniero (CIAA, 2025)

Pushdown and one-counter automata: Constant and non-constant memory usage. - Giovanni Pighizzini; Luca Prigioniero (Inf. Comput., 2025)

Kernels of Context-Free Languages. - Martin Kutrib; Luca Prigioniero (Int. J. Found. Comput. Sci., 2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata. - Bruno Guillon; Luca Prigioniero; Javad Taheri (CoRR, 2025)