The fast scanner generator for Java™ with full Unicode support
-
Updated
Sep 12, 2023 - Java
The fast scanner generator for Java™ with full Unicode support
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
🌁 Nondeterministic Finite State Automata for Java (in plain English: flowcharts with multiple possible outcomes)
UKZN Computer Science Theory of Computation 3rd year project.
Java program that converts regular expression to DFA.
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
Theory of Computation | Conversion from NFA to DFA
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
Java implementation of a Definite & Indefinite finite automata
A little toolbox that provides detector and converter for DFA machines
lexer & parser generator for java
Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.
Transforms DFA to regex and regex to DFA and NFA. (Finite State Machines) Demonstrate is done using the Kleene theorem. In addition, a comparison is made between the string sizes of the regular expressions obtained from converting DFA with a reduction.
Laboratorio B Diseño de Lenguajes de Programación
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."