Russ Cox/Rob Pike pikevm regex implementation
-
Updated
Jun 12, 2025 - C
Russ Cox/Rob Pike pikevm regex implementation
Kleene's-Theorem-Proof
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
draw NFA , convert to DFA , minimize DFA , export all graphs
Implementation and Simulation of TicTacTie via Deterministic Finite State Automata
Simulate (test) NFAs to recognise input strings
This Program is the implementation of NFA for accepting states in c
Non-Deterministic Finite Automata Simulation
A project for my study of NFA and its application.
A simple Java program to run non-deterministic final state automata (NFAs).
Introduction to Theoretical Computer Science laboratory exercises - Python solutions.
This is final project of Theory-of-Machines-and-Languages
18CSC304J Compiler Design Lab codes
A library that implements formal finite state automata.
Add a description, image, and links to the nfa-implementation topic page so that developers can more easily learn about it.
To associate your repository with the nfa-implementation topic, visit your repo's landing page and select "manage topics."