Composite Neutrosophic Finite Automata

Abstract

The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts
and its neutral that are uncertain and get common parts. Automata theory is beneficial to solve computational
complexity problem and also it is an influential mathematical modeling tool in computer science. Inspired by
the concepts of neutrosophic sets and automata theory, here, we are introducing and discussing the algebraic
concept of neutrosophic finite automata based on the paper [10]. Generally, composite machines can be achieved
by the output of the one machine that will be used as input for another machines. This paper introduced the
concept of composite automata under the environment of the neutrosophic set and also examined the box
function between the composite neutrosophic finite automata