A turing machine for both deterministic and nondeterministic way
-
Updated
Mar 20, 2019 - C
A turing machine for both deterministic and nondeterministic way
A simple interpreted language for building Turing machines and other automata
This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
Add a description, image, and links to the nondeterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the nondeterministic-finite-automata topic, visit your repo's landing page and select "manage topics."