Clemente, Lorenzo
- Advanced Automata Minimization
2012/10/24 by Lorenzo Clemente, Richard Mayr, Clemente, Lorenzo +1 · 1 citation
Computer Science · #68Q45 #D.2.4 #Data Structures and Algorithms (cs.DS) #F.1.1 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic, programming, and type systems #semigroups and automata theory
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
2016/05/02 by Lorenzo Clemente, Paweł Parys, Clemente, Lorenzo +5 · 1 citation
Computer Science · #semigroups and automata theory #Formal Methods in Verification #Logic, programming, and type systems
- Separability of Reachability Sets of Vector Addition Systems
2016/09/01 by Clemente, Lorenzo, Czerwiński, Wojciech, Lasota, Sławomir +1 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report)
2020/06/09 by Clemente, Lorenzo · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Weighted basic parallel processes and combinatorial enumeration
2024/07/04 by Clemente, Lorenzo · 1 citation
#Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)