nfa
Here are 285 public repositories matching this topic...
A Python program that uses an NFA to check if a regular expression matches a given string
-
Updated
May 18, 2020 - Python
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
-
Updated
Mar 27, 2020 - C++
lexer & parser generator for java
-
Updated
Oct 31, 2023 - Java
-
Updated
Dec 2, 2021 - C++
This repository contains solutions to some of the most commonly existing problems in automata and computation.
-
Updated
Jun 15, 2022
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…
-
Updated
Jul 13, 2022 - JavaScript
18CSC304J Compiler Design Lab codes
-
Updated
Feb 24, 2023 - C++
Resolução dos problemas de Teoria de Computação 2019/2020
-
Updated
Jul 10, 2020 - OCaml
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
-
Updated
Aug 9, 2023 - JavaScript
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
-
Updated
Mar 5, 2018 - Objective-C
Automaton execution and manipulation tool for Deno
-
Updated
Sep 1, 2020 - TypeScript
Detect useless transitions in Pushdown Automata
-
Updated
Feb 21, 2017 - C++
Improve this page
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."