Welcome to the Deterministic Finite Automaton's Language simulator.
In the theory of computation, a Deterministic Finite Automaton is a finite-state machine
that accepts or rejects strings of symbols and only produces a unique computation of the automaton for each
input string.
It is a model of computation which consists of a set of states that are
connected by
transitions.
We can represent this model using a graph.
Each node of the graph corresponds
to a state.
Each state can either have an accept state or reject
state.
The edges between each node correspond to
transitions.
For the purpose of this simulator, we will explore DFA with binary
strings
as inputs, therefore each transition can either have a value of 0 or
1.
The set of binary strings accepted by the DFA is known as the
language of the DFA.
Enough theory, let's get started with it !