Zero-forcing Finite Automata

The current study aims to establish a connection between graphs and automata theory, which apparently demonstrate different mathematical structures. through searching out some properties of one of these structures, we try to find some new properties of the other structure as well. this will result in obtaining some unknown properties. at first, a novel automaton called zero-forcing (z-f) finite automata is defined according to the notion of a zero-forcing set of a graph. it is shown that for a given graph and for some zero forcing sets, various z-f-finite automata will be obtained. in addition, the language and the closure properties of z-f-finite automata, in particular; union, connection, and serial connection are studied. moreover, considering some properties of graphs such as the closed trail, connected and complete; some new features for z-f-finite automata are presented. further, it is shown that there is not any finite graph such that f be a part of the language of its z-f-finite automata. actually, it is proved that for every given graph, the z-f-finite automata of it does not show any closed trail containing all edges for every zero forcing set, but if the graph g has been a closed trail containing all edges, then the z-f-finite automata of it has a weak closed trail containing all edges. some examples are also given to clarify these new notions.