nfa-implementation

Russ Cox/Rob Pike pikevm regex implementation

A proof illustrating Kleene’s theorem: a language is regular if it can be represented by a finite automaton or a regular expression.

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

A project for my study of NFA and its application.

This Program is the implementation of NFA for accepting states in c

A simple Java program to run non-deterministic final state automata (NFAs).

Non-Deterministic Finite Automata Simulation

18CSC304J Compiler Design Lab codes

This is final project of Theory-of-Machines-and-Languages

Draw it, run it, prove it: Theory of Computation, step by step. A free, browser-based toolkit that follows Sipser: DFAs, NFAs, PDAs and Turing machines, step-by-step conversions, pumping lemma game, decidability, PCP, NP-completeness, practice with instant feedback, and exam mode for Canvas.

Lambda-NFA implementation + word validation

A library that implements formal finite state automata.