default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Prigioniero
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský:
Performing Regular Operations with 1-Limited Automata. Theory Comput. Syst. 68(3): 465-486 (2024)- [c23]Guilherme Duarte
, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Block Languages and Their Bitmap Representations. CIAA 2024: 124-137 - [c22]Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Operational State Complexity of Block Languages. NCMA 2024: 59-76 - [i6]Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
On the Representation of Block Languages. CoRR abs/2404.11746 (2024) - 2023
- [j14]Giovanni Pighizzini, Luca Prigioniero:
Pushdown automata and constant height: decidability and bounds. Acta Informatica 60(2): 123-144 (2023) - [j13]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Weight-reducing Turing machines. Inf. Comput. 292: 105030 (2023) - [c21]Savinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti:
Magic Numbers in Periodic Sequences. WORDS 2023: 206-219 - [c20]Giovanni Pighizzini, Luca Prigioniero:
Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage. DCFS 2023: 146-157 - [c19]Giovanni Pighizzini, Luca Prigioniero:
Two-Way Machines and de Bruijn Words. CIAA 2023: 254-265 - [c18]Giovanni Pighizzini, Luca Prigioniero:
Forgetting 1-Limited Automata. NCMA 2023: 95-109 - [c17]Giovanni Pighizzini, Luca Prigioniero:
Once-Marking and Always-Marking 1-Limited Automata. AFL 2023: 215-227 - [i5]Savinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti:
Magic numbers in periodic sequences. CoRR abs/2304.03268 (2023) - 2022
- [j12]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. 289(Part): 104938 (2022) - [j11]Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Weakly and Strongly Irreversible Regular Languages. Int. J. Found. Comput. Sci. 33(3&4): 263-284 (2022) - [j10]Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský:
1-Limited Automata: Witness Languages and Techniques. J. Autom. Lang. Comb. 27(1-3): 229-244 (2022) - [c16]Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský:
Performing Regular Operations with 1-Limited Automata. DLT 2022: 239-250 - [i4]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. CoRR abs/2212.00891 (2022) - 2021
- [j9]Giovanni Pighizzini, Luca Prigioniero:
Non-Self-Embedding Grammars and Descriptional Complexity. Fundam. Informaticae 180(1-2): 103-122 (2021) - [j8]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible pushdown transducers. Inf. Comput. 281: 104813 (2021) - [j7]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. Int. J. Found. Comput. Sci. 32(6): 801-823 (2021) - [c15]Luca Prigioniero:
Regular Languages: To Finite Automata and Beyond (Invited Talk). AUTOMATA 2021: 2:1-2:16 - [c14]Martin Kutrib, Luca Prigioniero:
Boolean Kernels of Context-Free Languages. CIAA 2021: 152-164 - [i3]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines. CoRR abs/2103.05485 (2021) - [i2]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Weight-Reducing Turing Machines. CoRR abs/2103.05486 (2021) - 2020
- [b1]Luca Prigioniero:
Regular languages: to finite automata and beyond - succinct descriptions and optimal simulations. University of Milan, Italy, 2020 - [j6]Luca Prigioniero:
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations. Bull. EATCS 131 (2020) - [j5]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero:
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. Int. J. Found. Comput. Sci. 31(8): 1133-1157 (2020) - [c13]Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. DLT 2020: 137-149 - [p1]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, Luca Prigioniero, Irek Ulidowski, Germán Vidal:
Foundations of Reversible Computation. Selected Results of the COST Action IC1405 2020: 1-40
2010 – 2019
- 2019
- [j4]Giovanni Pighizzini, Luca Prigioniero:
Limited automata and unary languages. Inf. Comput. 266: 60-74 (2019) - [j3]Giovanna J. Lavado, Luca Prigioniero:
Concise Representations of Reversible Automata. Int. J. Found. Comput. Sci. 30(6-7): 1157-1175 (2019) - [j2]Bruno Guillon, Luca Prigioniero:
Linear-time limited automata. Theor. Comput. Sci. 798: 95-108 (2019) - [c12]Giovanni Pighizzini, Luca Prigioniero:
Pushdown Automata and Constant Height: Decidability and Bounds. DCFS 2019: 260-271 - [c11]Giovanni Pighizzini, Luca Prigioniero:
Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract. ICTCS 2019: 72-77 - 2018
- [c10]Bruno Guillon, Luca Prigioniero:
Linear-Time Limited Automata. DCFS 2018: 126-138 - [c9]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible Pushdown Transducers. DLT 2018: 354-365 - [c8]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT 2018: 366-378 - [c7]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero:
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. CIAA 2018: 186-197 - 2017
- [j1]Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. J. Autom. Lang. Comb. 22(1-3): 145-168 (2017) - [c6]Giovanna J. Lavado, Luca Prigioniero:
Concise Representations of Reversible Automata. DCFS 2017: 238-249 - [c5]Giovanni Pighizzini, Luca Prigioniero:
Limited Automata and Unary Languages. DLT 2017: 308-319 - [c4]Giovanni Pighizzini, Luca Prigioniero:
Non-self-embedding grammars and descriptional complexity. NCMA 2017: 197-209 - [c3]Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Weakly and Strongly Irreversible Regular Languages. AFL 2017: 143-156 - 2016
- [c2]Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. DCFS 2016: 168-179 - [c1]Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. ICTCS 2016: 234-239 - [i1]Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. CoRR abs/1611.06840 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
