01076121 THEORY OF COMPUTATION
-
Updated
Aug 30, 2023 - JavaScript
01076121 THEORY OF 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…
Interactive website for simulating variants of finite automata, Turing machines with 2D tapes, and k-queue automata
Finite Automaton
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
Graphical interface for designing finite automata
Add a description, image, and links to the finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the finite-automata topic, visit your repo's landing page and select "manage topics."