Luca Prigioniero
Title
Cited by
Cited by
Year
Limited automata and unary languages
G Pighizzini, L Prigioniero
Information and Computation 266, 60-74, 2019
72019
Weakly and Strongly Irreversible Regular Languages
GJ Lavado, G Pighizzini, L Prigioniero
arXiv preprint arXiv:1708.06465, 2017
72017
Non-self-embedding grammars, constant-height pushdown automata, and limited automata
B Guillon, G Pighizzini, L Prigioniero
International Journal of Foundations of Computer Science, 1-25, 2020
62020
Two-Way Automata and One-Tape Machines
B Guillon, G Pighizzini, L Prigioniero, D Průša
International Conference on Developments in Language Theory, 366-378, 2018
52018
Minimal and Reduced Reversible Automata.
GJ Lavado, G Pighizzini, L Prigioniero
Journal of Automata, Languages and Combinatorics 22 (1-3), 145-168, 2017
52017
Foundations of Reversible Computation
B Aman, G Ciobanu, R Glück, R Kaarsgaard, J Kari, M Kutrib, I Lanese, ...
International Conference on Reversible Computation, 1-40, 2020
42020
Pushdown Automata and Constant Height: Decidability and Bounds
G Pighizzini, L Prigioniero
International Conference on Descriptional Complexity of Formal Systems, 260-271, 2019
42019
Concise representations of reversible automata
GJ Lavado, L Prigioniero
International Conference on Descriptional Complexity of Formal Systems, 238-249, 2017
42017
Non-self-embedding grammars and descriptional complexity.
G Pighizzini, L Prigioniero
NCMA 2017, 197-209, 2017
42017
Minimal and reduced reversible automata
GJ Lavado, G Pighizzini, L Prigioniero
International Workshop on Descriptional Complexity of Formal Systems, 168-179, 2016
42016
Linear-time limited automata
B Guillon, L Prigioniero
Theoretical Computer Science 798, 95-108, 2019
32019
Reversible Pushdown Transducers
B Guillon, M Kutrib, A Malcher, L Prigioniero
International Conference on Developments in Language Theory, 354-365, 2018
22018
Weight-Reducing Turing Machines
B Guillon, G Pighizzini, L Prigioniero, D Průša
arXiv preprint arXiv:2103.05486, 2021
12021
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines
B Guillon, G Pighizzini, L Prigioniero, D Průša
arXiv preprint arXiv:2103.05485, 2021
12021
Space Complexity of Stack Automata Models
OH Ibarra, J Jirįsek, I McQuillan, L Prigioniero
International Conference on Developments in Language Theory, 137-149, 2020
12020
Concise Representations of Reversible Automata
GJ Lavado, L Prigioniero
International Journal of Foundations of Computer Science 30 (06n07), 1157-1175, 2019
12019
Linear-time limited automata
B Guillon, L Prigioniero
International Conference on Descriptional Complexity of Formal Systems, 126-138, 2018
12018
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations
L Prigioniero
Bulletin of EATCS 2 (130), 2020
2020
REGULAR LANGUAGES: TO FINITE AUTOMATA AND BEYOND-SUCCINCT DESCRIPTIONS AND OPTIMAL SIMULATIONS
L Prigioniero
Universitą degli Studi di Milano, 2020
2020
On Some Succinct Representations of Regular Languages
B Guillon, G Pighizzini, L Prigioniero
Italian Conference on Theoretical Computer Science 2243, 203-207, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20