Python solutions for Introduction to Theoretical Computer Science laboratory exercises.
-
Updated
Oct 11, 2023 - Python
Python solutions for Introduction to Theoretical Computer Science laboratory exercises.
This is final project of Theory-of-Machines-and-Languages
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
Add a description, image, and links to the nfa-implementation topic page so that developers can more easily learn about it.
To associate your repository with the nfa-implementation topic, visit your repo's landing page and select "manage topics."