VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
Abstract elided by the publisher.
Related papers
- LTL to Büchi Automata Translation: Fast and More Deterministic TACAS 2012
- Learning nominal automata POPL 2017
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata TACAS 2017
- Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata TACAS 2011
- Exploring different automata representations for efficient regular expression matching on GPUs PPoPP 2013
- Oregano: staging regular expressions with Moore Cayley fusion Haskell 2022
- Mata: A Fast and Simple Finite Automata Library TACAS 2024
- Regex matching with counting-set automata OOPSLA 2020