Related: I wrote Aude [1] (AUtomata DEmystifier) as a student. You can draw finite state machines with it. You can apply algorithms on those FSMs. You can run w

Related: I wrote Aude [1] (AUtomata DEmystifier) as a student. You can draw finite state machines with it. You can apply algorithms on those FSMs. You can run words on them. You'll see an animation of the word being run and you can choose the speed of the animation or run it step by step. You can translate them into regular expressions and translate regular expressions into FSMs. It'll use GraphViz to render the FSMs when you are not drawing them yourself. (since this is mainly for teaching, the regular expression language that it supports is very simple, it's not PCRE!) The animation in this article looks quite similar to the "Run word" feature in Aude, though the regular expression's elements of syntax like operators and parenthesis don't appear in FSMs produced by Aude. WebAssembly was not a thing, asm.js had just appeared. Aude uses a version of GraphViz compiled in asm.js to convert DOT strings to SVG. [1] https://aude.imag.fr/ https://aude.imag.fr/