• FINITE BINARY AUTOMATA

Abstract

Automata theory becomes a basis in theoretical computer science. The algebraic automaton has emerged with several modern applications because of having properties and structures from algebraic theory. In this paper we introduce the concept of Deterministic Finite Binary Automata DFBA. From the Finite State Automata, introducing a binary operation between the states, we obtain Finite Binary Automata. We also study the properties of DFBA.