C++ implementation of the DFA, NFA and e-NFA
-
Updated
Dec 22, 2013
C++ implementation of the DFA, NFA and e-NFA
Python simulator for Deterministic Turing Machines
Algorithm Design & Analysis for implementing Tic-Tac-Toe on Turing Machines
🎏 Conversor capaz de traduzir Autômatos Finitos Não Determinísticos em Autômatos Finitos Determinísticos. Projeto desenvolvido utilizando PyQt e JsonSchema, compatível com formatos JFLAP.
A C++ program to convert NFA to DFA
Contains coursework for the Theory Of Computation course offered at Shiv Nadar University.
Assignments for the course CSD303 Theory Of Computation
Deterministic Finite Automaton that works recursively to do union, intersection and complement operations
Theory of Computation Final Project
Fundamental Concepts of Computer Science (Draft) - by James Arvo
Final Project for CSCI333: Theory of Computation at St. Olaf College, Spring 2017
Python implementation of Stephen Wolfram's elementary cellular automata (in particular, Rule 30)
Naive GUI app for generating the context-free grammar (CFG) from an input deterministic finite automaton (DFA).
First project of Theory of Computation course (IFCE) (2016.1)
A language that allows you to define DFA's and test strings on them
This code produce DFA from the given input and check whether a string is accepted or not
Turing Machine that simulates behavior of any Deterministic Finite Automata
Add a description, image, and links to the theory-of-computation topic page so that developers can more easily learn about it.
To associate your repository with the theory-of-computation topic, visit your repo's landing page and select "manage topics."