Finite Automata
Grail - Symbolic computation with FSMs Supports conversion of Finite State Machines (FSM) to Regular Expressions (RE) and back and also conversion to and from finite languages. Freeware for academic use only. (Jun 1998)
Libero - a visual FSA generator Libero is a FSM generator suited to uses beyond parsing text. Libero reads a text file specifying states, events, and actions and generates code in any of 14 different languages, including C, C++ and COBOL. Libero is written in C and runs everywhere. (Oct 1997)
Ragel State Machine Compiler Ragel compiles finite state machines from regular languages into runnable C code. It allows you to embed actions at any point in your regular language and to control the non-determinism in the resulting machines. Win32/Linux. GPL (Oct 2002)
REGEX for Win32 REGEX is the regular expression string handling library as defined by POSIX. One common use of regular expressions is file wildcards. George J. Carette provides ports of both GNU REGEX and BSD REGEX specially ported to the Win32 environment. (Nov 1997)
Turing Machine for C++ The C++-program simulates a Turing Machine (TM). TM is defined by input files: metafile, states file, alphabet file, transition file, input word(s) file(s). Each row of metafile contains data related to some Turing machine (Nov 2002)
See also: AlgorithmsSee Also: if you are interested in Finite Automata you may find related topics in Algorithms
Books about Finite AutomataA complete list of books on Finite Automata available through Amazon.COM