Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)
-
Updated
Feb 11, 2023 - Python
Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)
Implementación de análisis léxico usando automatas
This is final project of Theory-of-Machines-and-Languages
Finite Automata
Theory of languages and automata projects in forth semester of university
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Add a description, image, and links to the nfa-to-dfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa-to-dfa topic, visit your repo's landing page and select "manage topics."