GustavoRuedaEnriquez / RE-to-DFA-parser Public

Notifications You must be signed in to change notification settings
Fork 1
Star 0

Regular Expressions to Deterministic Finite Automatons parser, used to obtain the minimum DFA, and also to check which strings are accepted by a given NFA.

0 stars 1 fork Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 56 Commits
.gitignore		.gitignore
M0.py		M0.py
M1.py		M1.py
M2.py		M2.py
M3.py		M3.py
M4.py		M4.py
M5.py		M5.py
M6.py		M6.py
Main.py		Main.py
README.md		README.md
input.txt		input.txt
output.txt		output.txt
regex.txt		regex.txt
temp.py		temp.py

Repository files navigation

RE to NFA parser

About

Regular Expressions to Deterministic Finite Automatons parser, used to obtain the minimum DFA, and also to check which strings are accepted by a given NFA.

regular-expression formal-languages automatons

Readme

Activity

0 stars

2 watching

1 fork

Report repository