A Java program that can emulate various computational models
-
Updated
Jun 11, 2024 - Java
A Java program that can emulate various computational models
Learning how to simulate a grammer in a Non Deterministic Finite Automata
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
A little toolbox that provides detector and converter for DFA machines
A Theory of Computation mini project in progress using Java and JavaFX GUI.
lexer & parser generator for java
A very simple regex matcher written in Java.
The fast scanner generator for Java™ with full Unicode support
A simple Java program to run non-deterministic final state automata (NFAs).
Implementation of a Finite Automata Simulator
🌁 Nondeterministic Finite State Automata for Java (in plain English: flowcharts with multiple possible outcomes)
Laboratorio B Diseño de Lenguajes de Programación
Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.
Implementation of fully-functioned finite automata (DFA/NFA), also include schematically implementation
Exploration of Formal Languages and the machines that go with them. Multiple examples of DFAs, NFAs, Stack Machines, and Turing Machines.
Samples of algorithms to verify strings / words using finite 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."