An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)

A fast and simple automata library

Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)

Graphical interface for designing finite automata

CSC504: Theory of Computer Science [TCS] | TE Semester V | Computer Engineering

Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.

PHP script with web interface that can optimize & draw your finite automata

An Elm app for building and simulating deterministic and non-deterministic finite automata (DFAs and NFAs).

Collection of my solutions to the finite automata course (2016 version) offered by Stanford.

Theory of machines and languages course project.

A Tool for Drawing the DFA/NFA of a Regex for a Regular Language

A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.

python compiler written in C, cpp ( c++ ), lex and yacc with the assistance of GNU flex & bison

Front-end Platypus compiler implemented in C. Includes Buffer, Scanner, and Parser. Platypus is a language comprised of parts from a variety of other languages.

Fundamental computing machines implemented in Clojure.

Interactive DFA Visualizer & Minimizer — Automata Theory Engine using Table-Filling Algorithm, built with JavaFX

Pure-Python library for building and working with nondeterministic finite automata (NFAs).

State machines for Laravel with Enums

Web application to manage finite state machine!

Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)

A teaching aid for concepts and algorithms in logic

Finite automata and regular languages

Repozitorijum sadrži materijale sa časova vežbi iz predmeta Prevođenje programskih jezika na Matematičkom fakultetu.

finite automata

Quantum Finite Automata simulators implementations in Python.

A utility tool used for validating regular expressions corresponding to a provided word

A cellular automata terminal screensaver. Think pipes.sh, but with automata

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

Language theory and compilation introduction TPs.

This project aims to simplify regular expressions using unique identifiers for equivalent expressions. It integrates various representations of regular languages and provides efficient algorithms for simplification and conversion. The system includes an additional layer for optimizing expression size using a Union-Find structure.