کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
390290 661238 2008 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A note on cut-worthiness of recognizable tree series
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A note on cut-worthiness of recognizable tree series
چکیده انگلیسی

The topic of this short note is tree series over semirings with partially ordered carrier set. Thus, tree series become poset-valued fuzzy sets. Starting with a collection of recognizable tree languages we construct a tree series recognizable over any semiring, such that the carrier set is a poset generated by the collection. In the framework of fuzzy structures, the starting collection becomes a subset of the collection of the corresponding cut sets. Under some stricter conditions, it is even equal to this collection. We also partially solve an open problem which was posed in Borchardt et al. [Cut sets as recognizable tree languages, Fuzzy Sets and Systems 157 (2006) 1560–1571]. Namely, we show that if ϕ is a given tree series over a partially ordered, locally finite semiring A, then ϕ is recognizable if and only if there are finitely many cut sets of ϕ and every cut set is a recognizable tree language.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Fuzzy Sets and Systems - Volume 159, Issue 22, 16 November 2008, Pages 3087-3090