This model accepts regular language descriptions from users, converts them to DFAs, and minimizes the DFAs. The minimized DFAs are then visualized as images, aiding users in understanding language structures. Implemented in Python, graph visualization tools, and minimization algorithms.
This project aims to implement fundamentals of theory of computation; such as DFAs, NFAs and more.
I have created a Turing Machine that can be used as a language acceptor, transducer, or to solve complicated tasks.
Building a syntax tree, and deriving a semantic term
Program to convert a program encoding based on its Gödel number to 𝒮 Language (S Language) or convert an 𝒮 Language program to it's program number
🐝 Spelling Bee's project is a Web Application for the Da Vinci Code Game.
A bunch of simple Automata simulation modules
Lab tasks performed for course BSCS-501 Theory of Computer Science.
Use a Theory of Computation concept and make a game
Theory of Computation Using Raspberry Pi to Simulate Stop Light
Text-Based Adventure Game using Theory of Computation
Lab homework (NFAs, DFAs, Turing machines) for the LFA/CS112 course (2nd semster, 1st year, FMI UniBuc).
Unlimited register machine implementation in Python.
Theory of computation course (Free university of Tbilisi) assignments.
Python simulator for Deterministic Turing Machines
An explanation of busy beaver problem with samples and codes
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."