Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Finite State Machines and Syntactic Semigroups

Klaus Sutner
Organization: Carnegie Mellon University
Department: School of Computer Science
Journal / Anthology

The Mathematica Journal
Year: 1992
Volume: 2
Issue: 1
Page range: 78-87

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.

*Applied Mathematics > Computer Science


Translate this page: