Limbaje Formale și Automate / Y1S2

A simple interpreted language for building Turing machines and other automata

An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.

LFA

DFA regular expression library & friends

A Shotgun Pipeline Toolkit app that helps you see what is out of date in your scene.

Monorepo containing the spot text editor and an implementation of the m4 macro processor

State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.

A simplistic programming language interpreter to Python to help students grasp finite automata theory programmatically and with a computed graph through visualization libraries.

Creates a transition table for a Deterministic Finite Automaton (DFA) and analyze input

Algorithms and Data Structure For Go Applications

RegEx Visualizer is a powerful tool that allows you to visualize the process of converting regular expressions into Non-deterministic Finite Automata (NFA), Deterministic Finite Automata (DFA), and minimized DFA.

Regex --> Postfix --> NFA --> DFA --> MinDFA

A Python library for simulating and visualizing finite automata

Shotgun Toolkit publishing app.

A Shotgun Pipeline Toolkit Engine for Houdini.

Provides a regular expression engine that uses a Nondeterministic finite automaton to simulate the regular expression

Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

Potata regex engine