An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
-
Updated
Mar 7, 2023 - TypeScript
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Graphical interface for designing finite automata
Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
PHP script with web interface that can optimize & draw your finite automata
An Elm app for building and simulating deterministic and non-deterministic finite automata (DFAs and NFAs).
Collection of my solutions to the finite automata course (2016 version) offered by Stanford.
Theory of machines and languages course project.
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.
Fundamental computing machines implemented in Clojure.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
A utility tool used for validating regular expressions corresponding to a provided word
Web application to manage finite state machine!
A teaching aid for concepts and algorithms in logic
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
Quantum Finite Automata simulators implementations in Python.
Repozitorijum sadrži materijale sa časova vežbi iz predmeta Prevođenje programskih jezika na Matematičkom fakultetu.
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."