A Pumping Lemma for Fuzzy Tree Language with a Threshold
عنوان مقاله: A Pumping Lemma for Fuzzy Tree Language with a Threshold
شناسه ملی مقاله: CSCG02_085
منتشر شده در دومین کنفرانس ملی محاسبات نرم در سال 1396
شناسه ملی مقاله: CSCG02_085
منتشر شده در دومین کنفرانس ملی محاسبات نرم در سال 1396
مشخصات نویسندگان مقاله:
M. Ghorani - Department of Applied Mathematics and Computer Science, Shahrood University of Technology, Shahrood, Iran
خلاصه مقاله:
M. Ghorani - Department of Applied Mathematics and Computer Science, Shahrood University of Technology, Shahrood, Iran
In this paper, at first, we recall some preliminaries related to tree automata. Then, we define fuzzy tree language with a threshold. Furthermore, a pumping lemma for fuzzy tree languages with a threshold is obtained. This lemma is extremely useful in proving that certain sets of ground trees are not recognizable. It is also useful for solving decision problems like emptiness and finiteness of are cognizable tree language. Our pumping lemma extends the pumping lemma obtained for fuzzy language and tree language. Also, we consider some decision problems such as emptiness problem and finiteness problem
کلمات کلیدی: Fuzzy tree automata, Pumping lemma, Fuzzy tree language with a threshold, Decision problems
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/696714/