Deteministic Finite Automaton Implementation in Python Language
-
Updated
Oct 24, 2018 - Python
Deteministic Finite Automaton Implementation in Python Language
Theory of machines and languages course project.
AUT Formal Languages and Automata course programming assignment
Finite automata (DFA and NFA) with functionality to convert NFAs to DFAs and check string acceptance.
Consiste na implementação de um simulador de Autômato Finito Determinístico (AFD) que aceite a especificação de um AFD.
DFA multiple substring search
A basic Python 3 project that scans a given word and returns if its valid or not based on a DFA defined by a text file
Add a description, image, and links to the dfa-simulator topic page so that developers can more easily learn about it.
To associate your repository with the dfa-simulator topic, visit your repo's landing page and select "manage topics."