<p>Take a look at L-FLAT, a Logtalk Toolkit for Formal Languages and Automata Theory. You can run it most Prolog compilers:</p>

<p><a href="https://code.google.com/p/lflat/" rel="nofollow">https://code.google.com/p/lflat/</a></p>

<p>It includes several examples of defining and operating on automata. There's also a paper about the system that you can download from:</p>

<p><a href="http://arxiv.org/abs/1112.3783" rel="nofollow">http://arxiv.org/abs/1112.3783</a></p>
Tool support for the study of automata and grammars
<p>I'm studying Formal languages ​​and compilers, and I'm doing a little bit hard to understand everything. 
Is there a tool that allows you to create automata and grammars and perform operations on them? 
Operations such as: minimize an automaton by automaton grammar, from grammar to automaton, make an epsilon-free grammar, etc. </p>

<p>Thank you very much</p>