next up previous contents index
Next: Mealy machines Up: Finite-state machines and neural Previous: What functions can a   Contents   Index

Nets with circles and finite-state machines

The second document featured in this section, a chapter in Infinite and Finite Machines (Minsky, 1967), is well known because it establishes the equivalence between neural nets with cyclic connections and a class of abstract computing devices called finite-state machines or finite automata. The following sections define three main classes of finite-state machines (FSM): Mealy machines, Moore machines and deterministic finite automata .


Debian User 2002-01-21