✒️ Automaton Theory class notes
-
Updated
Feb 7, 2018 - TeX
✒️ Automaton Theory class notes
Implementations and reports on the CYK algorithm, a simplified halting problem, and Turing-equivalent computational models.
A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case
an extended note of theory of computation, currently just include CFG part.
Solution of the problem sets of the course COL352- Introduction to Automata and Theory of Computation offered in Second (Holi) Semester 2021-22.
Algorithmic Operations Research
Notes for theory of computation
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.
Pushdown Automata Simulator allow user to graphically simulate function of PDAs.
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."