Assimilation of general neutrosophic automata

In this paper , we at first define the general neutrosophic automaton by considering the notion of the neutrosophic set . Then, for the general neutrosophic automaton , we give the notion of assimilation . Then , we present an algorithm to detect the assimilation relationship between two automata and calculate its time complexity . We also show that the union of assimilations on two general neutrosophic automata is itself assimilation between them . In addition , we prove that if there is an assimilation relationship between two general neutrosophic automata , then the language of the two automatons is equal .Next , by considering the largest assimilation between general neutrosophic automata , we present a quotient general neutrosophic automaton and show that this automaton is a minimal general neutrosophic automaton that preserves the language of the automaton . To make the concepts clearer , we give some examples .