Skip to content

Source code for a series of tutorials about the theory of computation formalized in Coq.

Notifications You must be signed in to change notification settings

ReedOei/FormalModelsOfComputation

Repository files navigation

Models of Computation

The source code for the tutorials on my blog, a WIP series on defining the fundamentals of the theory of computation, following the topics below.

  • Introduction: Part 1
  • DFAs: Part 2
  • NFAs: Part 3
  • Proof Automation
  • Regular Expressions
  • Equivalence of DFAs, NFAs, and Regular Expressions
  • Proving Regularity and Irregularity of Langauges
  • DFA Minimization
  • Decidability of formulas stated in terms of automata
  • Context Free Languages
  • Pushdown Automata
  • Probably more

About

Source code for a series of tutorials about the theory of computation formalized in Coq.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published