There are 1 repository under finite-automata topic.
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)
Graphical interface for designing finite automata
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).
Theory of machines and languages course project.
Collection of my solutions to the finite automata course (2016 version) offered by Stanford.
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.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Web application to manage finite state machine!
A teaching aid for concepts and algorithms in logic
python compiler written in C, cpp ( c++ ), lex and yacc with the assistance of GNU flex & bison
Quantum Finite Automata simulators implementations in Python.
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
Repozitorijum sadrži materijale sa časova vežbi iz predmeta Prevođenje programskih jezika na Matematičkom fakultetu.
A utility tool used for validating regular expressions corresponding to a provided word
Finite automata program made from a combination of two sub-programs, namely the lexical analyzer program and the parser program, this program will test a series of words in English.
A simple C++ library to simulate Finite Automata.
Command line tool for generating JFLAP files containing random FA's.
Python module for processing finite automata and regular expressions for use in the Theory of Compuation course
Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)
In a graphical way we transform a finite non-deterministic automate (NFA) to a deterministic finite automate (DFA)
Language theory and compilation introduction TPs.
Notes for Dr. Coleman's Compiler Design Class
This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)
Basic implementation of Finite Automaton (DFA, NFA) with for basic compiler written in OCaml.
Conways Game of life representation in a web page
👨🏽💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Finite Automaton
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Mini-JAVA compiler using Flex & Bison.
Tugas Besar Teori Bahasa dan Automata CCI2L3