MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

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.

CHOUBEY ALKA; RAVI K.M.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2013 | Volume:10 | Issue:1 Page(s): 75-88

Download Full-Text

View:

378

Download:

207

Cites:

Information Journal Paper

Title

MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

Author(s)

CHOUBEY ALKA | RAVI K.M. | Issue Writer Certificate

Keywords

INTUITIONISTIC FUZZY REGULAR LANGUAGE

INTERVAL-VALUED FUZZY REGULAR LANGUAGE

VAGUE REGULAR LANGUAGE

FINITE AUTOMATON WITH VAGUE (FINAL) STATES

FINITE AUTOMATON WITH INTUITIONISTIC FUZZY (FINAL) STATES

MYHILL-NERODE THEOREM

Abstract

In this paper, relations among the membership values of generalized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized finite automaton with vague (final) states for any VAGUE REGULAR LANGUAGE recognized by a finite automaton with vague final) states is shown in this paper. Finally, an efficient algorithm is given for minimizing the finite automaton with vague (final) states. Similarly, it can be shown for INTUITIONISTIC FUZZY REGULAR LANGUAGE. These may contribute to a better understanding of the role of finite automaton with vague (final) states or the finite automaton with intuitionistic fuzzy (final) states while studying lexical analysis, decision making etc.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

CHOUBEY, ALKA, & RAVI, K.M.. (2013). MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES. IRANIAN JOURNAL OF FUZZY SYSTEMS, 10(1), 75-88. SID. https://sid.ir/paper/596017/en

Vancouver: Copy

CHOUBEY ALKA, RAVI K.M.. MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2013;10(1):75-88. Available from: https://sid.ir/paper/596017/en

IEEE: Copy

ALKA CHOUBEY, and K.M. RAVI, “MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 10, no. 1, pp. 75–88, 2013, [Online]. Available: https://sid.ir/paper/596017/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops