Mazowiecki, Filip
- The Reachability Problem for Petri Nets is Not Elementary
2018/09/19 by Czerwinski, Wojciech, Lasota, Slawomir, Lazic, Ranko +2 · 3 citations
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
2023/05/02 by Künnemann, Marvin, Mazowiecki, Filip, Schütze, Lia +2 · 4 citations
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
2022/05/26 by Wojciech Czerwiński, Engel Lefaucheux, Czerwiński, Wojciech +7 · 2 citations
Chemistry · Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Organometallic Complex Synthesis and Catalysis #semigroups and automata theory
- A Robust Class of Linear Recurrence Sequences
2019/08/11 by Barloy, Corentin, Fijalkow, Nathanaël, Lhote, Nathan +1 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Weak Cost Register Automata are Still Powerful
2018/04/17 by Almagor, Shaull, Cadilhac, Michaël, Mazowiecki, Filip +1 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
2023/10/03 by Jecker, Ismaël, Mazowiecki, Filip, Purser, David · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)