Deterministic Finite Automata in C++, Token Parser & Lexer
-
Updated
Jan 28, 2013 - C++
Deterministic Finite Automata in C++, Token Parser & Lexer
Unitex/GramLab C++ Core
A Tool for Timed Patten Matching with Automata-Based Acceleration
A program to convert the given regular expression to Non Definite Automata (NFA)
Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.
Wolfram and Conway's Famous Cellular Automata
states is a utility for working with NFA, DFA and regular expressions
Extendable verification engine and simulator for Tick Tock Automata constructs
A C++ library for simulating automata and Turing machines
An esoteric programming language based on Turing Machines
Efficient Game of Life Implementation in C++
Laboratory problems and solutions for the ITMO course "Discrete Mathematics".
A Turing Machine simulator written in C++ and compiled on the command line.
Repositorio de prácticas de la materia de Compiladores. Implementación de las clases AFD y AFN, Conversión de una expresión regular a un AFN utilizando las construcciones de Thompson, conversión de un AFN a un AFD por el algoritmo de subconjuntos, generación de un analizador léxico por medio de Jaccie, analizador sintáctico por descenso recursiv…
C++ Class of Finite Automata, visualization and operations
A (simple) city building game
A C++ program to convert NFA to DFA
A utility tool used for validating regular expressions corresponding to a provided word
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."