Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
-
Updated
Dec 30, 2017 - C++
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
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-comparator topic page so that developers can more easily learn about it.
To associate your repository with the finite-automaton-comparator topic, visit your repo's landing page and select "manage topics."