Luca Prigioniero

Orcid: 0000-0001-7163-4965

According to our database1, Luca Prigioniero authored at least 30 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Performing Regular Operations with 1-Limited Automata.
Theory Comput. Syst., June, 2024

Operational State Complexity of Block Languages.
Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

On the Representation of Block Languages.
CoRR, 2024

Block Languages and Their Bitmap Representations.
Proceedings of the Implementation and Application of Automata, 2024

2023
Weight-reducing Turing machines.
Inf. Comput., June, 2023

Pushdown automata and constant height: decidability and bounds.
Acta Informatica, June, 2023

Once-Marking and Always-Marking 1-Limited Automata.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Forgetting 1-Limited Automata.
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

Two-Way Machines and de Bruijn Words.
Proceedings of the Implementation and Application of Automata, 2023

Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

Magic Numbers in Periodic Sequences.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
1-Limited Automata: Witness Languages and Techniques.
J. Autom. Lang. Comb., 2022

Weakly and Strongly Irreversible Regular Languages.
Int. J. Found. Comput. Sci., 2022

Converting nondeterministic two-way automata into small deterministic linear-time machines.
Inf. Comput., 2022

2021
Space Complexity of Stack Automata Models.
Int. J. Found. Comput. Sci., 2021

Reversible pushdown transducers.
Inf. Comput., 2021

Non-Self-Embedding Grammars and Descriptional Complexity.
Fundam. Informaticae, 2021

Boolean Kernels of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2021

Regular Languages: To Finite Automata and Beyond (Invited Talk).
Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020

Regular languages: to finite automata and beyond - succinct descriptions and optimal simulations.
PhD thesis, 2020

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.
Int. J. Found. Comput. Sci., 2020

Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations.
Bull. EATCS, 2020

2019
Linear-time limited automata.
Theor. Comput. Sci., 2019

Concise Representations of Reversible Automata.
Int. J. Found. Comput. Sci., 2019

Limited automata and unary languages.
Inf. Comput., 2019

Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Minimal and Reduced Reversible Automata.
J. Autom. Lang. Comb., 2017

Weakly and Strongly Irreversible Regular Languages.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017


  Loading...