My implementations of deterministic and non-deterministic turing machines
-
Updated
Jun 20, 2023 - C
8000
My implementations of deterministic and non-deterministic turing machines
Software to look for interrelationships between constants and find formulas for number sequences
This unit introduces formal languages, models of computation, and computational complexity. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness.
SUTD 2020 50.002 Computation Structures Code Dump
Simulation of Basic Calculator through the Turing Machine
This program schools, simulates, and searches for exact or approximate Turing Machines (TMs) with specific characteristics.
Nondeterministic Turing-machine simulator // Final assignment of PoliMi Algorithms and Data Structures course (API) 2017-2018
A simple free-form interpreted language for building Turing machines and other automata
A simple C program to emulate two symbol turing machine
A fast, lightweight command-line based Turing Machine simulator.
A very small VM loosely based on the P'' formal language.
Questo è un emulatore della macchina di Turing del seguente video:
A turing machine for both deterministic and nondeterministic way
Turing Machine simulator inspired by the summary in A Biography of the Pixel (Alvy Ray Smith)
Basics of CS
Educational C lab for Automata Theory & Formal Languages: DFA, NFA, Mealy, CFG, PDA, Turing machines, conversion algorithms (ATFL / TOC).
Add a description, image, and links to the turing-machine topic page so that developers can more easily learn about it.
To associate your repository with the turing-machine topic, visit your repo's landing page and select "manage topics."