The Mathematica Journal

Search

About the Journal
Current Issue
Editorial Policy
Submissions
Back Issues
Contact Information

index.html

Finite State Machines and Syntactic Semigroups

Volume 2, Issue 1
1992
Klaus Sutner, Stevens Institute of Technology
 

Automata, a collection of Mathematica Notebooks that generate and manipulate finite state machines and their syntactic semigroups, supports all the standard operations on finite state machines such as the construction of product machines, Kleene closure, minimal automata and isomorphism testing. Automata includes type conversion commands between deterministic and nondeterministic machines, and conversion from and to regular expressions. There are also commands to compute an automaton's syntactic semigroup, its defining equations and its D-class decomposition.

     
About Mathematica 
© Wolfram Media, Inc. All rights reserved.