Languages of single-valued neutrosophic general automata

Abstract

In this paper, we define the concepts of single-valued neutrosophic general automaton, complete and deterministic single-valued neutrosophic general automaton. We present a minimal single-valued neutrosophic general automaton that preserves the language for a given single-valued neutrosophic general automaton. Moreover, we present the closure properties such as union and intersection for single-valued neutrosophic general automata.

Keywords

• neutrosophic set
• automata
• intuitionistic set
• submachine
• general fuzzy automata