Python simulator for Deterministic Turing Machines
-
Updated
Mar 6, 2015 - Python
Python simulator for Deterministic 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.
Python implementation of Stephen Wolfram's elementary cellular automata (in particular, Rule 30)
Use a Theory of Computation concept and make a game
This repository contains various programs related to the theory of computation
Turing machine implementation for spelling Turkish words
A simple example of Deterministic Finite Automata (DFA) in Python.
Compiler Components
Envy free, Fair Rent Division System for Hostel Rooms. This is a project made as a part of the Project Track in the course ESC101 offered in Spring 2019 at IIT Kanpur.
An efficient method of lighting up LEDs based on the concept of Cellular Automata transition
Building a syntax tree, and deriving a semantic term
Theory of Computation Using Raspberry Pi to Simulate Stop Light
puzzles, problems, search, sort, graph, constraint, theory, symbolic
Implementation of a Pushdown Automaton, the recognizer module of Context-Free Languages.
Exercício Programa que faz a emulação de um Autômato Finito Não Determinístico (AFN) para a matéria de Introdução à Teoria da Computação 💻
Theory of computation course (Free university of Tbilisi) assignments.
common algorithms in automata theory - minimization algorithms, regex compilers etc.
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."