Toolbox for automaton theory, language theory, lambda calculus, propositional logic, and formal semantics. Including simulations, applications, parsers, and algorithm implementations.
-
Updated
Dec 13, 2022 - JavaScript
Toolbox for automaton theory, language theory, lambda calculus, propositional logic, and formal semantics. Including simulations, applications, parsers, and algorithm implementations.
Interactive website for simulating variants of finite automata, Turing machines with 2D tapes, and k-queue automata
This repository contains a Python program for checking the acceptability of strings in a Finite State Machine (FSM). The program allows users to define the FSM by providing the number of states, inputs, transitions, and final states. It then evaluates user-provided strings to determine if they are acceptable within the specified FSM.
Add a description, image, and links to the finite-automaton-simulator topic page so that developers can more easily learn about it.
To associate your repository with the finite-automaton-simulator topic, visit your repo's landing page and select "manage topics."