Pushdown automata based on lattice-valued logic: closure properties and decision problems
Publish place: 2rd International Conference on Soft Computing
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 374
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CSCG02_181
تاریخ نمایه سازی: 7 اسفند 1396
Abstract:
This paper introduces the concept of pushdown automata based on complete residuated lattice-valued logic (for short, -valued pushdown automata). We consider some closure properties of -valued pushdown automata, including max and star. Then, we give some fundamental decision problems including the membership-value, the emptiness-value and the finiteness-value problems
Authors
M. Ghorani
Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran