The Ultimate Automata Library supports the following kinds of automata.
The library is maintained by Matthias Heizmann, Alexander Nutz, and Christian Schilling.
The library is available via a web interface. We devised a small script language called Automata Script that allows to define automata and specify operations that should be performed. You can find several sample files in the web interface.
The operation minimizeNwaPmaxSat (see example) implements the algorithm of the Minimization of Visibly Pushdown Automata Using Partial Max-SAT paper which was published at TACAS 2017. It uses a domain-specific partial Max-SAT solver for reducing the size of nondeterministic nested word automata. Additional material: extended version, slides
The operation buchiComplementNCSB (see example) implements the algorithm of the Complementing Semi-deterministic Büchi Automata paper which was published at TACAS 2016. Additional material: preprint, files to reproduce evaluation, slides
The operation loopComplexity computes the loop complexity of finite automata. An example automata script file is available in our web interface.
The source code is available on GitHub.