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
This is a Morse code translator which is implemented using the Turing machine in Jflap software.
NFA (nondeterministic finite automaton) simulator using C++
This C++ code defines a finite automaton that reads an input string and determines whether it's accepted or rejected based on user-defined transitions, states, and final states. It's a simple representation of automata theory and language recognition.
A theory of computing project that introduces converting a non-deterministic finite automaton (nfa) to a deterministic finite automaton (dfa).
Theory of Computation Final Project
some useful papers.
Assignments and Exercises implemented during undergrad
Designing Pushdown Automata and Turing machine for Safe Submarine Battle
Prácticos y teórico de la materia de Lenguajes Formales y Computabilidad de la Licenciatura en Ciencias de la Computación de FAMAF (UNC)
Deterministic Finite Automaton that works recursively to do union, intersection and complement operations
Lexical Analyzer for dynamically identifying token.
The computer science fundamentals for bachelors-Subject wise
Register-based machines (DNA and Multiset) written in Java which were used in the Theory of Computation's assignment.
Verification of a string against a regular expression
Python implementation of block decomposition method for approximating algorithmic complexity
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."