Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
-
Updated
Jun 26, 2022 - Java
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Artifact of the POPL paper Undecidability of D<: and Its Decidable Fragments
Add a description, image, and links to the undecidability topic page so that developers can more easily learn about it.
To associate your repository with the undecidability topic, visit your repo's landing page and select "manage topics."