decidability

CSC504: Theory of Computer Science [TCS] | TE Semester V | Computer Engineering

VUTBR - FIT: TIN 2018/2019

Non-structural subtype entailment is decidable

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 Python-based project exploring Decidability and Undecidability using Turing Machine simulations

Towards a decidability proof for the ALCI_RCC5 description logic with RCC5 composition table

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

领域无关的策略语言定义、可判定性编译与形式化验证元框架：有界量词展开为无量词 SMT-LIB2，多求解器并行竞速，输出业务可读反例与最小冲突核。