Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
Active learning tool designed to explore the pumping lemma property for regular language
Questions for the Formal Languages and Machines (FLA) course, Faculty of Computer Engineering, Shahid Beheshti University. Course instructor: Dr. Ramak Ghavamizadeh
Browser-based regex and finite-automata visualizer for CPSC 351: regex to NFA/DFA, minimization, NFA-to-regex, closure constructions, the pumping lemma, equivalence-graded challenges, and step-by-step simulation, in course-exact notation. Client-side, accessible, no backend. A companion to the AArch64 Playground.
Interactive Theory of Computation workbench — DFA/NFA, regular expressions, CFGs, PDAs, Turing machines and undecidability, every algorithm traced step by step in textbook language. Web app + vyakarana, a Python package for Jupyter/Colab.
Computability and formal-languages coursework: automata, grammars, Turing machines, and decidability proofs
Bishop's University - CS 310 Introduction to Software Specifications
Investigate models of computation, formal languages, and computability in Haskell to build an Interpreter
To associate your repository with the pumping-lemma topic, visit your repo's landing page and select "manage topics."