CSC504: Theory of Computer Science [TCS] | TE Semester V | Computer Engineering
-
Updated
Feb 20, 2026
CSC504: Theory of Computer Science [TCS] | TE Semester V | Computer Engineering
VUTBR - FIT: TIN 2018/2019
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
A comprehensive Theory of Automata study and past-paper archive built around IBA’s CSE309 offerings, with lectures, exercises, problem sets, quizzes, exams, solutions, and curated external resources from multiple semesters. Open to students from any university and future community contributions.
A generic functional substrate implemented as an immutable, decidable resolver graph.
Additional LaTeX material for the course Automaten en Berekenbaarheid (2nd year Computer Science @ KU Leuven Kulak)
📝 Solutions to the exercise sessions
Computability and formal-languages coursework: automata, grammars, Turing machines, and decidability proofs
Add a description, image, and links to the decidability topic page so that developers can more easily learn about it.
To associate your repository with the decidability topic, visit your repo's landing page and select "manage topics."