Detect useless transitions in Pushdown Automata
-
Updated
Feb 21, 2017 - C++
Detect useless transitions in Pushdown Automata
Parsing JSON for Topologic. A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well a…
giva nfa,translat nfa to dfa , minimize dfa , you will get your dfa information
A very simple regex matcher written in Java.
A little toolbox that provides detector and converter for DFA machines
A Powerful and Fast regex engine. Featuring pure DFA match, Thompson NFA match(extended regex should be supported soon), regex operation(union, intersection , complementary), DFA to regex is also available
Automaton execution and manipulation tool for Deno
Design a pharmacy vending machine using Finite State 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."