Skip to content
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Python Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Building a Turing Machine
Building an NFA
Calculator
DFA Minimization
Finite Machines #1
Finite Machines #2
Finite Machines #3
Language Description Reader
NFA to DFA Converter
Prefix to Postfix
Sudoku Solver
Turing Machine Simulator
.gitignore
README.md

README.md

🔃 Computational Models - CS260 🔀

Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator.

I took this class in Fall 2017. Each folder is its own project/exercise. Each folder in this repository explores a topic on its own. The projects/exercises are all in Python and can be walked through easily. Projects include:

  • Building a Turing Machine

  • Building an NFA

  • Calculator

  • DFA Minimization

  • Finite Machines

  • Language Description

  • NFA to DFA Converter

  • Prefix to Postfix

  • Sudoku Solver

  • Turing Machine Simulator

Feel free to clone this repository and to explore the projects.

You can’t perform that action at this time.