1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings
-
Updated
Jun 10, 2019 - Java
#
thompson-algorithm
Here are 4 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
A Java program that can emulate various computational models
-
Updated
Nov 3, 2024 - Java
A Theory of Computation mini project in progress using Java and JavaFX GUI.
regex javafx finite-state-machine nfa dfa nfa-to-dfa-conversion thompson-algorithm dfa-minimization-algorithm
-
Updated
Mar 4, 2024 - Java
Improve this page
Add a description, image, and links to the thompson-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the thompson-algorithm topic, visit your repo's landing page and select "manage topics."