A Python package for automata theory.

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

This repository contains an implementation of DISC, an algorithm for learning DFAs for multiclass sequence classification.

CS Graph editor : Javscript based frontend visual graph editor

This is about DFA optimization/Minimization in C program

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)

Lexical Analyzer , Syntax Analyzer and Semantic Analyzer. using, DFA, FSA, cfgs, regular expressions , will implement different parsers e.g CLR0, LL1 , OPERATOR etc

A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️

Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

This is the "one": Linuxy infrastructureish mostly C++ code.

Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)

Projet CY-Tech

Syntax tree method implementation to convert a regular expression to DFA.

Implementation and Simulation of TicTacTie via Deterministic Finite State Automata

A C++ library to create, load, and analyze Deterministic Finite Automata (DFA) with up to 10 states and lowercase letter alphabets. Offers file loading, state modification, and string acceptance checks.

FlyWeight Finite Automata Simulator

:arrows_clockwise: Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator :twisted_rightwards_arrows:

Automata implementations

No description provided.

A collection of efficient automata algorithms implemented in the C programming language, designed to solve various computational problems.

A C++ implementation to simulate a DFA for the regular expression (a|b)*abb+

Algorithm::ConstructDFA2 Perl module

Experience DFA like never before; enter regex, watch transitions animate in real-time, and master automata with an engaging, interactive dark interface.

A project containing data structures for different kinds of automata (DFAs/NFAs), a simple custom language defining operations on them, as well as a fully functional and customizable GUI editor.

Please read the Design Report.

regular expressions to DFA via direct method

Compiler Construction | Spring 2025 | i220812 & i220872

A powerful toolkit for converting Regular Expressions to DFA and Context-Free Grammars. Built for students, educators, and enthusiasts of Theory of Automata.

Finite state automaton animator