adhamhshm / nfa-to-rg-generator Public

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

NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
screenshots		screenshots
README.md		README.md
main.css		main.css
main.html		main.html
main.js		main.js
sample_string.txt		sample_string.txt

Repository files navigation

NFA to RG

An asignment for TIC2151 Theory of Computation. Developed in HTML, CSS and JavaScript.

About

NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.

finite-state-automata theory-of-computation non-deterministic-finite-automaton regular-grammar nfa-to-rg

Report repository

Releases

No releases published

Packages

No packages published

Languages