Share on Facebook Tweet on Twitter Share on LinkedIn Share by email

Automata is a .NET tool kit that provides facilities for manipulating and analyzing regular expressions, symbolic finite automata, and symbolic finite transducers. It supports automata and transducers where input and output alphabets can be fully symbolic. Constraints over the alphabets can be analyzed using Satisfiability Modulo Theory (SMT) solvers. The tool kit provides a particular extension that uses the Microsoft SMT solver Z3.

Automata project has moved to Github:


Online Demos

Bek and Bex are showcased with sample sanitizers and string encoders.