- Polyregular Model Checking Aliaume Lopez Rafał Stefański Tue 25 March 2025
- Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs Michal Ajdarw Thu 13 March 2025
- A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity Stefan Mengel Harry Vinall-Smeeth Tue 10 December 2024
- CMSO-transducing tree-like graph decompositions Rutger Campbell Bruno Guillon Mamadou Moustapha Kanté Eun Jung Kim Noleen Köhler Tue 10 December 2024
- Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton Günter Rote Tue 10 December 2024
- A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata Semyon Petrov Alexander Okhotin Tue 10 December 2024
- Probability and Angelic Nondeterminism with Multiset Semantics Shawn Ong Stephanie Ma Dexter Kozen Tue 10 December 2024
- mathbbN-polyregular functions arise from well-quasi-orderings Aliaume Lopez Fri 18 October 2024
- A Type System Describing Unboundedness Paweł Parys Thu 25 May 2023
- History-deterministic Parikh Automata Enzo Erlich Shibashis Guha Ismaël Jecker Karoliina Lehtinen Martin Zimmermann Fri 02 March 2012
- Parikh Automata on Infinite Words Mario Grobler Leif Sabellek Sebastian Siebertz Fri 02 March 2012
Library Size: 13G (11 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
