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)
A little toolbox that provides detector and converter for DFA machines
Theory of Computation | Conversion from NFA to DFA
Learning how to simulate a grammer in a Non Deterministic Finite Automata
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
Assignments for the course CSD303 Theory Of Computation
lexer & parser generator for java
UKZN Computer Science Theory of Computation 3rd year project.
Java library for RegexSolver API.
Laboratorio B Diseño de Lenguajes de Programación
Java program that converts regular expression to DFA.
A little toolbox that provides detector and converter for DFA machines
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."