A Python program that uses an NFA to check if a regular expression matches a given string
-
Updated
May 18, 2020 - Python
A Python program that uses an NFA to check if a regular expression matches a given string
This repository contains solutions to some of the most commonly existing problems in automata and computation.
Aplikas Finite Automata Text Search menggunakan mesin nondeterministik finite automata (NFA) dengan menerapkan extended transition function (delta topi). Dalam text search, penerapan konsep NFA (Non-deterministic Finite Automata) dapat digambarkan saat kita diberi satu set string yang akan disebut dengan kata kunci (keyword), kemudian NFA akan m…
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
Detect useless transitions in Pushdown Automata
giva nfa,translat nfa to dfa , minimize dfa , you will get your dfa information
A very simple regex matcher written in Java.
Variations around Savitch's Theorem
Important programs for Automata Lab for C.S.E 4th Sem.
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."