A Pumping Lemma for Fuzzy Tree Language with a Threshold
Publish place: 2rd International Conference on Soft Computing
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 412
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CSCG02_085
تاریخ نمایه سازی: 7 اسفند 1396
Abstract:
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
Keywords:
Authors
M. Ghorani
Department of Applied Mathematics and Computer Science, Shahrood University of Technology, Shahrood, Iran