Automata and transducer library for .NET
C# Other
Latest commit a041efa Feb 4, 2017 @veanes veanes Added HtmlEncode experiment
The experiment compares performance on randomly generated inputs betaeen
two versions on HtmlEncode. One in AntiXss library and one that is
automatically generated after fusion of two STBs.


Automata is a .NET library that provides algorithms for composing and analyzing regular expressions, automata, and transducers. In addition to classical word automata, it also includes algorithms for analysis of tree automata and tree transducers. The library covers algorithms over finite alphabets as well as their symbolic counterparts. In symbolic automata concrete characters have been replaced by character predicates. Such predicates can range over very large or even infinite alphabets, like integers. Predicates can be supported by an SMT solver as a plugin.