Skip to content
#

deterministic-finite-automata

Here are 24 public repositories matching this topic...

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

  • Updated Dec 29, 2020
  • Java

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

  • Updated Mar 11, 2023
  • Java

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.

  • 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