Transformations of Finite State Automata
This applet optimizes a Finite State Automaton by eliminating lambda-transitions and non-determinism and, subsequently, by minimizing the resulting deterministic automaton. The optimized automaton can be reorganized by moving transitions and states using the mouse.
Applet developed for a undergraduate project for the course Formal Languages and Automata by the computer science students Leonardo A. S. Pacheco, Denis Fonseca de Oliveira, Rachid Alves Antunes and Ricardo Fonseca e Campos