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

Regex libraries benchmark

Theory of Computation | Conversion from NFA to DFA

Learning how to simulate a grammer in a Non Deterministic Finite Automata

Converts a given NFA to DFA

lexer & parser generator for java

UKZN Computer Science Theory of Computation 3rd year project.

Java program that converts regular expression to DFA.

Assignments for the course CSD303 Theory Of Computation

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

A basic implementation of regex.

Laboratorio B Diseño de Lenguajes de Programación

A little toolbox that provides detector and converter for DFA machines

A Java program that can emulate various computational models

all about compiler