A New Algorithm for Determining the Equivalence of Two Finite-State Automata
Edward E. Ogheneovo · Journal of Advances in Mathematics and Computer Science · 2018
Finite-state automaton is a machine that processes input strings and produces output indicating whether the input string is accepted or not. It is an acceptor recognizer for input specification. A finite-state automaton is an input/output device that accepts strings as input and...
Open access
Research Article
10.9734/JAMCS/2018/37848