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

Graphical interface for designing finite automata

RustyLR is a parser generator that converts context-free grammars into IELR(1)/LALR(1) tables with deterministic LR and GLR parsing strategies. It supports custom reduce action in Rust, with beautiful diagnostics.

Finite Automata and Regular Expressions for Regular Languages in Haskell

A C++ library for simulating automata and Turing machines

A python CLI tool for creating diagrams of finite state machines.

Theory of Computation | Conversion from NFA to DFA

regular expression engine based on deterministic finite automata(DFA)

A Qt 5 Python GUI application for converting regular expressions to a finite automaton

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..

Converts a given epsilon-NFA to NFA to DFA

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

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

This is a lex program to simulate NFA/ DFA

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

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

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

Aplicación de consola que convierte Expresiones Regulares a Autómatas Finitos No Deterministas

Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)

Trabalhos da matéria na UFT