Multidimensional fuzzy finite tree automata

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOGHARI S.; ZAHEDI M.M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2019 | Volume:16 | Issue:5 Page(s): 155-167

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

573

Download:

187

Cites:

Information Journal Paper

Title

Multidimensional fuzzy finite tree automata

Author(s)

MOGHARI S. | ZAHEDI M.M. | Issue Writer Certificate

Keywords

Multidimensional fuzzy tree languagesQ2

fuzzy dual languagesQ2

closure propertiesQ2

determinizationQ2

reductionQ2

Abstract

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for each dimension, a fuzzy membership grade is assigned to each tree. We study MFFTA by extending some classical problems and properties of automata and regular languages such as determinization, reduction, duality and operations on languages. Furthermore, we provided the method of converting every complete fuzzy tree automata to an MFFTA as well as an example to show the efficiency of MFFTA in comparison to FFTA.

Cites

No record.

References

No record.

Cite

APA: Copy

MOGHARI, S., & ZAHEDI, M.M.. (2019). Multidimensional fuzzy finite tree automata. IRANIAN JOURNAL OF FUZZY SYSTEMS, 16(5 ), 155-167. SID. https://sid.ir/paper/113432/en

Vancouver: Copy

MOGHARI S., ZAHEDI M.M.. Multidimensional fuzzy finite tree automata. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2019;16(5 ):155-167. Available from: https://sid.ir/paper/113432/en

IEEE: Copy

S. MOGHARI, and M.M. ZAHEDI, “Multidimensional fuzzy finite tree automata,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 16, no. 5 , pp. 155–167, 2019, [Online]. Available: https://sid.ir/paper/113432/en

Related Journal Papers