This repository contains a vast collection of academic notes, study materials, and resources from various semesters of Data Science course.
-
Updated
Aug 4, 2024 - HTML
This repository contains a vast collection of academic notes, study materials, and resources from various semesters of Data Science course.
an attempt at unpacking in layman's terms what is computation and information.
Python implementation of block decomposition method for approximating algorithmic complexity
Computation Theory project 2024. A transpiler that converts an imaginary language 'lambda' into executable C source code.
a collection of materials from Talking Theory on YouTube
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)
Comparison study between various methods of evaluation for untyped lambda expressions, with practical implementations available
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.
Markov algorithms interpreter and a Telegram bot to test and manage these via. Many unique self written markov algorithms included. Not maintained. Reffer to https://github.com/faraui/markov instead.
Exercise for Theory of Computation Exam @ Unifi - Turing Machines Simulator.
Research experience
Pushdown Automata Simulator allow user to graphically simulate function of PDAs.
Open-ended natural selection of interacting code-data-dual algorithms as a property analogous to Turing completeness.
This is a repository created to store the questions related to theory of Computation. This maynot be the most efficient way of solving the problem.
Simple program to manipulate NFAs, DFAs and grammars.
The interdicplinary of Mathematics and Computer Science, Distinguisehed by its emphasis on mathemtical technique and rigour.
I'm learning a Functional Programming by learning its pure math concepts and apply it on functional language like Haskell, Clojure, Elixir, etc.
Convert C++-like code into a Turing Machine representation
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.
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."