There are 9 repositories under theory-of-computation topic.
Math & CS Awesome List, distinguished by proof and logic and technique
A Flock of Functions: Combinators, Lambda Calculus, & Church Encodings in JS
Here are my GATE CSE 2021 Resources
Materials that might help studying for introduction to theoretical CS
These are my programs for compiler design lab work in my sixth semester
here the notes provided by the seniors who already cracked IITs as well as how much I'll cover for my exams I'll provide my notes as well. If you want you can access the course by these links also
A Figma like Editor to Design Custom Finite State Machines
This repository includes academic notes, study materials, and resources from B.Tech (Hons) in CSE, specializing in Artificial Intelligence and Data Science. It features question papers, proprietary study guides, and resources to support learning in these fields.
Python implementation of Stephen Wolfram's elementary cellular automata (in particular, Rule 30)
:coffee:Graduate Student's Fundamental Computational Fluid Dynamics (CFD) Course's homework and projects
My all Programming books available for public to download
[WIP] :books: A python automata library implementing Finite Automata, FA with Output and PDA
McCulloch & Pitts neural net simulator.
A tool for converting context-free grammars to different normal forms.
This repository contains various programs related to the theory of computation
Open-ended natural selection of interacting code-data-dual algorithms as a property analogous to Turing completeness.
CSC504: Theory of Computer Science [TCS] <Semester V>
Simple turing machine simulator using the syntax of the online simulator at turingmachinesimulator.com
Racket code to demonstrate lambda calculus concepts
Naive GUI app for generating the context-free grammar (CFG) from an input deterministic finite automaton (DFA).
Solution of the problem sets of the course COL352- Introduction to Automata and Theory of Computation offered in Second (Holi) Semester 2021-22.
Two way slab analysis by Fourier Method
C++ implementation of the DFA, NFA and e-NFA
Convert C++-like code into a Turing Machine representation
Lambda Kalkül für praktisches vanilla JavaScript - IP5 HS2019 / IP6 HS2020
Complete notes for DTU students | MCE | 6 sem
This is a universal Turing Machine Application in which you can simulate any Deterministc Turing Machine. Written in C#(.NET 5)
A C++ program to convert NFA to DFA
Investigation into Computation.
Turing machine implementation for spelling Turkish words
A contribution depot for the Future Minds Initiative provided by the Electrostat-Lab.
The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.