NEW DIRECTION IN FUZZY TREE AUTOMATA

Publish Year: 1390
نوع سند: مقاله ژورنالی
زبان: English
View: 103

This Paper With 10 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJFS-8-5_005

تاریخ نمایه سازی: 7 تیر 1401

Abstract:

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of Nondeterministic FuzzyFinite Tree Automata (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we define the notion of fuzzy complex stateand Complex FFTA (CFFTA). Also, we define\nabla-normalization operation in algebra of fuzzy complexstate to solve the multi membership state problem in fuzzyautomata. Furthermore, we discuss the relationship between FFTAand CFFTA. Finally, determinization of CFFTA is presented.

Keywords:

Fuzzy tree automata , Complex fuzzy tree automata , Determinization

Authors

S. Moghari

Department of Mathematics, Science Faculty, Alzahra University, Vanak, Tehran, Iran

M. M. Zahedi

Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran

R. Ameri

College of Sciences, Tehran University, P.O. Box ۱۴۱۵۵-۶۴۵۵, Tehran, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • bibitem{Arbib:a}M. A. Arbib, {it From automata theory to brain theory}, ...
  • Man-Machine Studies, {bf ۷}textbf{(۳)} (۱۹۷۵), ۲۷۹-۲۹۵ ...
  • bibitem{Bozapalidis:a}S. Bozapalidis and O. L. Bozapalidoy, {it Fuzzy tree languagerecognizability}, ...
  • bibitem{Comon:a}H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, ...
  • Loding, S. Tison and M. Tommasi, {it Tree automata: techniquesand ...
  • bibitem{Doner:a}J. E. Doner, {it Decidability of the weak second-order theory ...
  • bibitem{Doner:b}J. E. Doner, {it Tree acceptors and some of their ...
  • bibitem{Doostfatemeh:a}M. Doostfatemeh and S. C. Kremer, {it New directions in ...
  • bibitem{Gaines:a}B. Gaines and L. J. Kohout, {it The logic of ...
  • General Systems, {bf ۲} (۱۹۷۶), ۱۹۱-۲۰۸ ...
  • bibitem{Horry:a}M. Horry and M. M. Zahedi, {it Hypergroups and general ...
  • bibitem{Mateescu:a}A. Mateescu, A. Salomaa, K. Salomaa and S. Yu, {it ...
  • bibitem{Mordeson:a}J. Mordeson and D. Malik, {it Fuzzy automata and languages:theory ...
  • bibitem{Rabin:a}M. O. Rabin, {it FHandbook of mathematical logic}, NorthHolland, ۱۹۷۷ ...
  • bibitem{Thatcher:a}J. W. Thatcher and J. B. Wright, {it Generalized finite ...
  • bibitem{Thatcher:b}J. W. Thatcher and J. B. Wright, {it Generalized finiteautomata}, ...
  • bibitem{Thomas:a}W. Thomas, {it Handbook of theoretical computer science},Elsevier, {bf B} ...
  • bibitem{Wee:a}W. G. Wee, {it On generalization of adaptive algorithm andapplication ...
  • bibitem{Ying:a}M. Ying, {it A formal model of computing with words}, ...
  • نمایش کامل مراجع