This is a lex program to simulate NFA/ DFA

Experiment to test multiple words into nondeterministic finite automatas.

Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.

Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)

Collected list of benchmarks for evaluating different approaches to reasoning about regular properties.

Implementation Of finite State Machines In JAVA

Document Text Search Using Non-deterministic Finite Automata

A python program that helps convert NFAs to DFAs. (Uses networkx)

Detect useless transitions in Pushdown Automata

Exam Project for the course "Programming Languages": implementation of an URL parser in Prolog and Lisp.

🔴 A non-deterministic finite-state machine for Android & JVM that won't let you down

Classes to simulate various automatas in Formal Language Theory

Diploma Thesis - CEID University of Patras. Application name: N2D: NFA to DFA Converter

NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.

This is a simple single page web-application calculator to demonstrate Search the word in the given text document by the use of NFA and conversion from Regular Expression to Non-deterministic automata (NFA) using source libraries such as React.JS, Node.JS and Express.JS etc..

This TypeScript project is a concise Regular Expression Compiler, providing efficient tokenization, AST generation, and NFA compilation for streamlined handling of regular expressions.

Tool for converting a non deterministic finite automaton to a deterministic one.

regular expression engine based on deterministic finite automata(DFA)

GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action