Finite Autonoma Creator
Status: Version 1.0
Run via Webstart (b06)

If you're interested in computational theory, this program can be very useful for visualizing and creating finite state machines. The interface is very simple and self explanatory, and you can easily drag states and links around to serve your purposes.


Features
Usage
The program is fairly simple to use if you're familiar with Finite Autonama and computational theory, but otherwise you'll find yourself confused over exactly what this is. If you don't know what an FA is, I advise you avoid the program. Otherwise, the implementation is very self explanatory and can best be learned through experimentation.

Future
This program is done and done. If I still had interest in working on this (which I don't), I might create other kinds of combinatorial machines.