DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
عنوان مقاله: DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
شناسه ملی مقاله: JR_IJFS-14-5_003
منتشر شده در در سال 1396
شناسه ملی مقاله: JR_IJFS-14-5_003
منتشر شده در در سال 1396
مشخصات نویسندگان مقاله:
Renu . - Indian School of Mines, Dhanbad, India
S. P. Tiwari - Department of Applied Mathematics, Indian Institute of Technology (ISM), Dhanbad-۸۲۶۰۰۴, India
خلاصه مقاله:
Renu . - Indian School of Mines, Dhanbad, India
S. P. Tiwari - Department of Applied Mathematics, Indian Institute of Technology (ISM), Dhanbad-۸۲۶۰۰۴, India
In this paper, we introduce and study notions like state-\\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related to output completeness of states and discuss the interrelationship between them.
کلمات کلیدی: Crisp deterministic fuzzy automaton, Indistinguishable states, Input-indistinguishable, homomorphism, Output complete
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1460714/