NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
-
Updated
Aug 31, 2023 - JavaScript
NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
ZOPSEDU Integrated University Management system framework with ZOPS Development Platform
Encapsule Project Holistic App Platform runtime libraries and appgen utility.
finite-state automata implementation in javascript
Create and simulate finite state machines in your browser. Includes interactive exercises.
An experiment on Whynot.js
A JavaScript interpreter for Finite State Automata
Add a description, image, and links to the finite-state-automata topic page so that developers can more easily learn about it.
To associate your repository with the finite-state-automata topic, visit your repo's landing page and select "manage topics."