A Python program that uses an NFA to check if a regular expression matches a given string
-
Updated
May 18, 2020 - Python
A Python program that uses an NFA to check if a regular expression matches a given string
Regular expression converter into non-deterministic empty state finite automata, and word recognition in the automaton
Theory of computation course (Free university of Tbilisi) assignments.
A simple script to convert Python regular expression to expressions following the formal defintion
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
Implementation of Ruxx Cox's https://swtch.com/~rsc/regexp/regexp1.html in python
giva nfa,translat nfa to dfa , minimize dfa , you will get your dfa information
a verbose regular expression engine for learning purposes
Codes to convert Regex-to-NFA, NFA-to-DFA, DFA -to-Regex, minimizing DFA.
❗ Trabalho Prático – Fundamentos da Teoria da Computação
All CC-Labs of Sir Nadeem.
Python solutions for Introduction to Theoretical Computer Science laboratory exercises.
Lab homework (NFAs, DFAs, Turing machines) for the LFA/CS112 course (2nd semster, 1st year, FMI UniBuc).
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."