Skip to main content
SpringerLink
Log in

A Simplified Form of Fuzzy Multiset Finite Automata

  • Conference paper
  • First Online:
Artificial Intelligence Perspectives in Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 464))

Abstract

Fuzzy multiset finite automata represent fuzzy version of finite automata working over multisets. Description of these automata can be simplified to such a form where transition relation is bivalent and only the final states form a fuzzy set. In this paper it is proved that the simplified form preserves computational power of the automata and way of how to perform the corresponding transformation is described.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Unfortunately, this is not accompanied by necessary demand of finite support of the fuzzy relation. However omission of this condition would cause invalidity of Theorems 4.2 and 5.2 in [16].

References

  1. Bělohlávek, R.: Determinism and fuzzy automata. Inf. Sci. 143, 205–209 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blizard, W.D.: Multiset theory. Notre Dame J. Form. Log. 30(1), 36–66 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blizard, W.D.: The development of multiset theory. Mod. Log. 1(4), 319–352 (1991)

    MathSciNet  MATH  Google Scholar 

  4. Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset automata. In: Calude, C.S., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing—Mathematical, Computer Science, and Molecular Computing Points of View. LNCS, vol. 2235, pp. 69–83. Springer, Berlin (2001)

    Google Scholar 

  5. Dubois, D., Prade, H.: Fuzzy Sets and Systems: Theory and Applications. Academic Press, New York (1980)

    MATH  Google Scholar 

  6. González de Mendívil, J.R., Garitagoitia, J.R.: Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure. Fuzzy Sets Syst. 249, 1–26 (2014)

    Google Scholar 

  7. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Pearson Addison Wesley, Upper Saddle River (2003)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Kudlek, M., Martín-Vide, C., Păun, G.: Toward a formal macroset theory. In: Calude, C.S., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing—Mathematical, Computer Science, and Molecular Computing Points of View. LNCS, vol. 2235, pp. 123–133. Springer, Berlin (2001)

    Google Scholar 

  10. Kudlek, M., Totzke, P., Zetsche, G.: Multiset pushdown automata. Fund. Inf. 93, 221–233 (2009)

    MathSciNet  MATH  Google Scholar 

  11. Kudlek, M., Totzke, P., Zetsche, G.: Properties of multiset language classes defined by multiset pushdown automata. Fund. Inf. 93, 235–244 (2009)

    MathSciNet  MATH  Google Scholar 

  12. Li, Y., Pedrycz, W.: Minimization of lattice finite automata and its application to the decomposition of lattice languages. Fuzzy Sets Syst. 158(13), 1423–1436 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Martinek, P.: Fuzzy multiset finite automata: determinism, languages, and pumping lemma. In: Tang, Z., Du, J., Yin, S., He, L., Li, R. (eds.) 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery, pp. 64–68. China, Zhangjiajie (2015)

    Google Scholar 

  14. Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages: Theory and Applications. Chapman and Hall/CRC, Boca Raton (2002)

    Book  MATH  Google Scholar 

  15. Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology, Boston (2006)

    MATH  Google Scholar 

  16. Wang, J., Yin, M., Gu, W.: Fuzzy multiset finite automata and their languages. Soft Comput. 17(3), 381–390 (2013)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Tomas Bata University in Zlin, T. G. Masaryka 5555, Zlín, Czech Republic

    Pavel Martinek

Authors
  1. Pavel Martinek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Martinek .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Martinek, P. (2016). A Simplified Form of Fuzzy Multiset Finite Automata. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Artificial Intelligence Perspectives in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-319-33625-1_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33625-1_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33623-7

  • Online ISBN: 978-3-319-33625-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation