Introduction

Welcome to the finite automata tool (FAT) website.

The FAT is a tool that implements and illustrates various algorithms on deterministic and non-deterministic finite automata including:

• determinization via the powerset construction
• minimization of deterministic finite automata
• intersection, union, and complement

All algorithms are visualized where one can either let the algorithms run automatically or in a step-by-step mode.

The quickest way to start is to launch FAT as Java webstart-application, click on New automaton and then use one of the example automata. (A complete description of the syntax of automata is given on the grammar page.) Once an automaton is added one can select one or two automata and click on the corresponding algorithm to start it.

For more details about FAT we refer to the manual. And the different available versions of FAT are explained on the downloads page.

For general questions or comments contact Stefan Kopeinig or René Thiemann.