Skip to content
#

deterministic-finite-automata

Star

Here are 25 public repositories matching this topic...

Language: Java
Filter by language
All 133 Python 39 Java 25 C++ 18 JavaScript 12 C 8 C# 8 Go 6 Haskell 4 Vue 2 Jupyter Notebook 1
Sort: Most stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

amir-azari / DFA-Minimizer-JavaFX

Star 8

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.

visualization java converter algorithm state-machine javafx minimization graph-theory automaton dfa automata-theory dfa-minimization deterministic-finite-automata dfa-converter finite-automata dfa-minimizer
  • Updated Mar 11, 2025
  • Java

AmineAgrane / finite-state-automaton-library

Star 3

The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc

finite-state-machine nfa dfa deterministic-finite-automata nfa-to-dfa-conversion thompson-algorithm
  • Updated Dec 29, 2020
  • Java

alphinaud11 / Compiler

Star 2

An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

java compiler antlr lexical-analysis regular-expressions context-free-grammar theory-of-computation deterministic-finite-automata syntax-directed-definition left-recursion-elimination ll1-parser first-and-follow non-deterministic-finite-automata
  • Updated Mar 11, 2023
  • Java

josevandermeulen / Simplifier

Star 0

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.

regular-expressions regular-languages deterministic-finite-automata finite-automata efficient-data-structures simplification-of-regular-expressions comparison-of-regular-expressions derivatives-of-regular-expressions equivalence-of-regular-expressions extended-regular-expressions minimal-deterministic-finite-automata operations-on-regular-languages regular-equation-systems imperative-programming-with-java
  • Updated Jul 30, 2024
  • Java

Improve this page

Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."

Learn more