Implemented Core Concepts Of Finite Automation in order To make Typing Game
-
Updated
Jul 13, 2018 - Java
Implemented Core Concepts Of Finite Automation in order To make Typing Game
NFA (nondeterministic finite automaton) simulator using C++
Deterministic Finite Automaton that works recursively to do union, intersection and complement operations
The computer science fundamentals for bachelors-Subject wise
Verification of a string against a regular expression
Python implementation of block decomposition method for approximating algorithmic complexity
Theory of Computation Final Project
Use a Theory of Computation concept and make a game
Theory of Computation Using Raspberry Pi to Simulate Stop Light
Trabajo práctico transversal / Teoría de la Computación 1
This repository contains my personal assignments, solutions, and any related work for my self-study of the MIT 18.404/6.840 Theory of Computation course (Fall 2020) available on the MIT OpenCourseware website.
Text-Based Adventure Game using Theory of Computation
Comparison study between various methods of evaluation for untyped lambda expressions, with practical implementations available
A language that allows you to define DFA's and test strings on them
Apuntes de la cátedra
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."