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
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.
Bishop's University - CS 310 Introduction to Software Specifications
Investigate models of computation, formal languages, and computability in Haskell to build an Interpreter
Add a description, image, and links to the pumping-lemma topic page so that developers can more easily learn about it.
To associate your repository with the pumping-lemma topic, visit your repo's landing page and select "manage topics."