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++
A theory of computing project that introduces converting a non-deterministic finite automaton (nfa) to a deterministic finite automaton (dfa).
A language that allows you to define DFA's and test strings on them
Apuntes de la cátedra
A simple quine generator (for sed).
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.
online algo app where you check your string is valid or not
Theory of Computation Final Project
Designing Pushdown Automata and Turing machine for Safe Submarine Battle
Notes for theory of computation
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.
Deterministic Finite Automaton that works recursively to do union, intersection and complement operations
The computer science fundamentals for bachelors-Subject wise
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."