Skip to main content
SpringerLink
Log in

Construction of a minimal realization and monoid for a fuzzy language: a categorical approach

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

The purpose of the present work is to construct a minimal deterministic fuzzy automaton and to provide a minimal monoid representation for a given fuzzy language in a categorical framework. The construction of such automaton is based on derivative of a given fuzzy language, while the construction of minimal monoid representation is based on factor monoid.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abolpour, K., Zahedi, M.M.: BL-general fuzzy automata and accept behaviour. J. Appl. Math. Comput. 38, 103–118 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  2. Elgot, C.C., Rutledge, J.D.: Operations on finite automata. In: Proc. AIEE Second Annual Symposium on Switching Theory and Logical Design, Detroit (1961)

  3. Goguen, J.A.: \(L\)-fuzzy sets. J. Math. Anal. Appl. 18, 145–174 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ignjatović, J., Ćirić, M., Bogdanović, S.: Determinization of fuzzy automata with membership values in complete residuated lattices. Inf. Sci. 178, 164–180 (2008)

    Article  MATH  Google Scholar 

  5. Ignjatović, J., Ćirić, M., Bogdanović, S., Petković, T.: Myhill-Nerode type theory for fuzzy languages and automata. Fuzzy Sets Syst. 161, 1288–1324 (2010)

    Article  MATH  Google Scholar 

  6. Jun, Y.B.: Intuitionistic fuzzy finite state machines. J. Appl. Math. Comput. 17, 109–120 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jun, Y.B.: Intuitionistic fuzzy finite switchboard state machines. J. Appl. Math. Comput. 20, 315–325 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jun, Y.B.: Quotient structures of intuitionistic fuzzy finite state machines. Inf. Sci. 177, 4977–4986 (2007)

    Article  MATH  Google Scholar 

  9. Kim, Y.H., Kim, J.G., Cho, S.J.: Products of \(T\)-generalized state machines and \(T\)-generalized transformation semigroups. Fuzzy Sets Syst. 93, 87–97 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kumbhojkar, H.V., Chaudhri, S.R.: On proper fuzzification of fuzzy finite state machines. Int. J. Fuzzy Math. 4, 1019–1027 (2008)

    Google Scholar 

  11. Lihua, W., Qiu, D.: Automata theory based on complete residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst. 161, 1635–1656 (2010)

    Article  MATH  Google Scholar 

  12. Li, Y., Pedrycz, W.: Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst. 156, 68–92 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: Lexical Analysis with a simple finite-fuzzy-automaton model. J. Univ. Comput. Sci. 1, 292–311 (1995)

    MATH  MathSciNet  Google Scholar 

  14. Malik, D.S., Mordeson, J.N., Sen, M.K.: Submachines of fuzzy finite state machine. J. Fuzzy Math. 2, 781–792 (1994)

    MATH  MathSciNet  Google Scholar 

  15. Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages: Theory and Applications. Chapman and Hall, London (2002)

    Book  Google Scholar 

  16. Myhill, J.: Finite automata and the representation of events. In: WADD TR-57-624, Wright Patterson AFB, Ohio, pp. 112–137 (1957)

  17. Nerode, A.: Linear automata transformation. Proc. Am. Math. Soc. 9, 541–544 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  18. Qiu, D.: Automata theory based on complete residuated lattice-valued logic (I). Sci. China 44, 419–429 (2001)

    MATH  Google Scholar 

  19. Qiu, D.: Automata theory based on complete residuated lattice-valued logic (II). Sci. China 45, 442–452 (2002)

    Article  MATH  Google Scholar 

  20. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  21. Raney, G.N.: Sequential functions. J. ACM 5, 177–180 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tiwari, S.P., Singh, A.K.: On minimal realization of fuzzy behaviour and associated categories. J. Appl. Math. Comput. (2013). doi:10.1007/s12190-013-0720-y

  23. Wee, W.G.: On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification. Ph. D. Thesis, Purdue University, Lafayette (1967)

  24. Xing, H., Qiu, D., Liu, F., Fan, Z.: Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst. 158, 1407–1422 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Indian School of Mines, Dhanbad , 826004, India

    S. P. Tiwari, Vijay K. Yadav & Anupam K. Singh

Authors
  1. S. P. Tiwari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay K. Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anupam K. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. P. Tiwari.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tiwari, S.P., Yadav, V.K. & Singh, A.K. Construction of a minimal realization and monoid for a fuzzy language: a categorical approach. J. Appl. Math. Comput. 47, 401–416 (2015). https://doi.org/10.1007/s12190-014-0782-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-014-0782-5

Keywords

Search

Navigation