Skip to main content
Log in

Isomorphism between two BL-general fuzzy automata

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this note first we develop the notion of general fuzzy automata (GFA) to a new one which is called “BL-general fuzzy automata” and for simplicity, we write BL-GFA, instead of BL-general fuzzy automata. Then we focus on derivation, active state set, membership assignment, output mappings, and concept of belonging to an output label according to the entrance input strings \( X \, (X \in \Upsigma^{ * } ) \) for BL-general fuzzy automata. Therefore, we define the concepts of run map and behavior of BL-GFA. After that we present the morphism with threshold \( \tfrac{{\tau_{1} }}{{\tau_{2} }} \) between two BL-general fuzzy automata. Moreover we give some examples, to clarify these notions. Finally, we prove some theorems. In particular, we show that the isomorphic BL-general fuzzy automata have the same behavior.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Arbib MA (1975) From automata theory to brain theory. Int J Man-Machine Stud 7(3):279–295

    Article  MathSciNet  MATH  Google Scholar 

  • Burks AW (1975) Logic, biology and automata -some historical reflections. Int J Man-Machine Stud 7(3):297–312

    Article  MATH  Google Scholar 

  • Doostfatemeh M, Kremer SC (2005) New directions in fuzzy automata. Int J Approx Reason 38:175–214

    Article  MathSciNet  MATH  Google Scholar 

  • Hajek P (1988) Metamathematics of fuzzy logic. Kluwer, Dordrecht

    Google Scholar 

  • Hopcroft JE, Motwani R, Ullman JD (2001) Introduction to automata theory, languages and computation, 2nd edn. Addison-Wesley, Reading

    MATH  Google Scholar 

  • Malik DS, Mordeson JN (2000) Fuzzy discrete structures. Physica-Verlag, New York

    MATH  Google Scholar 

  • Minsky ML (1967) Computation: finite and infinite machines, Chap 3. Prentice-Hall, Englewood Cliffs, pp 32–66

  • Mordeson JN, Malik DS (2002) Fuzzy automata and languages, theory and applications. Chapman and Hall/CRC, London/Boca Raton

    Book  MATH  Google Scholar 

  • Omlin W, Thornber KK, Giles CL (1998) Fuzzy finite-set automata can be deterministically encoded into recurrent neural networks. IEEE Trans Fuzzy Syst 5(1):76–89

    Article  Google Scholar 

  • Omlin W, Giles CL, Thornber KK (1999) Equivalence in knowledge representation: automata, rnns, and dynamical fuzzy systems. Proc IEEE 87(9):1623–1640

    Article  Google Scholar 

  • Turunen E (2001) Boolean deductive systems of BL-algebras. Arch Math Logic 40:467–473

    Article  MathSciNet  MATH  Google Scholar 

  • Wee WG (1967) On generalization of adaptive algorithm and application of the fuzzy sets concept to pattern classification. PhD thesis, Purdue University, Lafayette

  • Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kh. Abolpour.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abolpour, K., Zahedi, M.M. Isomorphism between two BL-general fuzzy automata. Soft Comput 16, 729–736 (2012). https://doi.org/10.1007/s00500-011-0782-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-011-0782-4

Keywords

Navigation