An Elm app for building and simulating deterministic and non-deterministic finite automata (DFAs and NFAs).
-
Updated
Aug 21, 2021 - Elm
An Elm app for building and simulating deterministic and non-deterministic finite automata (DFAs and NFAs).
📋 A regular language recognizer software using Finite Automata
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Graphical interface for designing finite automata
Theory of machines and languages course project.
Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
Naive Algorithm, Rabin-Karp Algorithm, Finite Automata Algorithm, KMP Algorithm.
Fork of leapfrogdevelopment/rstr from bitbucket
Front-end Platypus compiler implemented in C. Includes Buffer, Scanner, and Parser. Platypus is a language comprised of parts from a variety of other languages.
Algoritimo para teste de automatos finitos deterministicos e não deterministicos utilizando python.
A simple C++ library to simulate Finite Automata.
A simple state machine library.
👨🏽💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Finite Automaton
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Representations of various versions of finite automata in Scala.
A utility tool used for validating regular expressions corresponding to a provided word
Collection of my solutions to the finite automata course (2016 version) offered by Stanford.
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."