Limbaje Formale și Automate / Y1S2
-
Updated
Jun 9, 2024 - Python
Limbaje Formale și Automate / Y1S2
A simplistic programming language interpreter to Python to help students grasp finite automata theory programmatically and with a computed graph through visualization libraries.
A Python library for simulating and visualizing finite automata
Text-Based Adventure Game using Theory of Computation
A Python package for automata theory.
Implementation of Ruxx Cox's https://swtch.com/~rsc/regexp/regexp1.html in python
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
A small project demonstrating both deterministic and nondeterministic finite state machines
Python solutions for Introduction to Theoretical Computer Science laboratory exercises.
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
Regular expression converter into non-deterministic empty state finite automata, and word recognition in the automaton
Theories of Machines and Languages Project - Spring 2022
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."