Turing Machine Model

An implementation of Turing Machine and Automaton for language theory

Models

Finite Automaton

Finite State machine, with no memory. Exist:

1. Recognizer
2. Generator
3. Transducer

Stack Automaton

Stack memory machine with states

Turing Machine