Unitex/GramLab C++ Core
-
Updated
Dec 9, 2023 - C++
Unitex/GramLab C++ Core
Deterministic Finite Automata in C++, Token Parser & Lexer
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.
A C++ library for simulating automata and Turing machines
states is a utility for working with NFA, DFA and regular expressions
Discrete Mathematics course at ITMO University
A Turing Machine simulator written in C++ and compiled on the command line.
Finite state automata and regular expressions. Context-free grammars and pushdown automata. Turing machines. Models of computable functions and undecidable problems. The course emphasis is on the theory of computability, especially on showing limits of computation. May be taken for graduate credit.
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…
Random fun with automatas
In this blog I explain this pratice https://medium.com/@martincorona007/lexical-analysis-13f3b517854b
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."