Deterministic Finite Automata in C++, Token Parser & Lexer
-
Updated
Jan 28, 2013 - C++
Deterministic Finite Automata in C++, Token Parser & Lexer
C++ implementation of the DFA, NFA and e-NFA
A JavaScript interpreter for Finite State Automata
Contains coursework for the Theory Of Computation course offered at Shiv Nadar University.
An experiment on Whynot.js
Fundamental Concepts of Computer Science (Draft) - by James Arvo
A model designed for an elevator that also checks the constraints and specifications for a finite state machine. Also contains a finite state machine for multiplication.
A very simple process function of finite state machine
A Pythonic container interface for finite state machines.
Tool for manipulating Regular Languages
Create and simulate finite state machines in your browser. Includes interactive exercises.
Build data-driven finite state machines ✨❐⇢❑✨
Correcting errors in the input text with Thrax
State machine creation framework written in Swift inspired by GKStateMachine from Apple GameplayKit
Classes to simulate various automatas in Formal Language Theory
Evolving agents to play deck-based divide-the-dollar.
Finite State Machine editor
NFA, DFA simulator with Angular 5 and Easeljs
Theoretical Foundations: Automata and language theory; computability theory. Uses programming projects to show the relationship between theory and application.
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."