A C++ library for simulating automata and Turing machines
-
Updated
Jun 14, 2023 - C++
A C++ library for simulating automata and Turing machines
Graphical interface for designing finite automata
A Qt 5 Python GUI application for converting regular expressions to a finite automaton
Parses a given string through a provided non-deterministic finite automaton
[PORTUGUÊS] Trabalho de Linguagens Formais e Autômatos para a faculdade
Finite Automata and Regular Expressions for Regular Languages in Haskell
Theory of Computation | Conversion from NFA to DFA
Implementation Of finite State Machines In JAVA
This is a lex program to simulate NFA/ DFA
Experiment to test multiple words into nondeterministic finite automatas.
regular expression engine based on deterministic finite automata(DFA)
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)
Collected list of benchmarks for evaluating different approaches to reasoning about regular properties.
A python program that helps convert NFAs to DFAs. (Uses networkx)
Detect useless transitions in Pushdown Automata
Exam Project for the course "Programming Languages": implementation of an URL parser in Prolog and Lisp.
Document Text Search Using Non-deterministic Finite Automata
Add a description, image, and links to the non-deterministic-finite-automaton topic page so that developers can more easily learn about it.
To associate your repository with the non-deterministic-finite-automaton topic, visit your repo's landing page and select "manage topics."