کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
390570 661270 2009 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Automata theory based on complete residuated lattice-valued logic: A categorical approach
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Automata theory based on complete residuated lattice-valued logic: A categorical approach
چکیده انگلیسی

Automata theory based on complete residuated lattice-valued logic, called L-valued automata (L-VAs), has been primarily established by Qiu in 2001 and 2002. In this paper, we consider the L-VAs that have L-valued initial and final states. We study the categorical issue of L-VAs. The main technical contributions include: (1) We investigate the relationship between the category of L-VAs and the category of non-deterministic automata (NDAs); also, we study the relationship between the category of generalized L-VAs and the category of NDAs. (2) We prove the existence of isomorphisms between the category of L-VAs and the subcategory of generalized L-VAs and between the category of L-VAs and the category of sets of NDAs. (3) Finally, we further investigate some specific relationships between the output L-valued subsets of generalized L-VAs and the output L-valued subsets of NDAs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Fuzzy Sets and Systems - Volume 160, Issue 16, 16 August 2009, Pages 2416-2428