Vorlesungsunterlagen "Theoretische Informatik und Logik", Fakultät Informatik, TU Dresden
-
Updated
Jul 4, 2024 - TeX
Vorlesungsunterlagen "Theoretische Informatik und Logik", Fakultät Informatik, TU Dresden
The framework of the future
The following example is meant to demonstrate how a Deterministic Finite Automata(DFA) algorithm is supposed to guide identify whether a string is an email adress ending with .gov or .gr
simulate universal turing machines using the gödel numbering
Advanced programming and algorithmization in C++ ⚔️
Una raccolta di risorse per l'insegnamento di Informatica teorica (11933) del Corso di Laurea in Informatica.
Unofficial digital notes for Stanford's algorithmic game theory course (CS269I: Incentives in Computer Science).
This article provides examples of monomial deciders, monomial generators, and picking functions and the methods to develop them.
The following project should define a PDA that in its turn would recognize a specific context-free language.
Turing machine simulator
A language of polynomials.
Implementation of a Pushdown Automaton that recognizes strings belonging to a language valid arithmetic expressions over floating point numbers
Unterlagen zur Vorlesung "Formale Systeme", Fakultät Informatik, TU Dresden
My personal website.
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.
Online Maximum Independent Set of Hyperrectangles
Simple turing machine simulator using the syntax of the online simulator at turingmachinesimulator.com
Implementation of a Deterministic Finite Automaton for email address recognition
Add a description, image, and links to the theoretical-computer-science topic page so that developers can more easily learn about it.
To associate your repository with the theoretical-computer-science topic, visit your repo's landing page and select "manage topics."