Skip to main content
SpringerLink
Log in

General-Nondeterministic Fuzzy Pushdown Automata and Their Languages

  • Conference paper
  • First Online:
Theoretical Computer Science (NCTCS 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1693))

Included in the following conference series:

  • 250 Accesses

Abstract

Inspired by nondeterministic fuzzy finite automata theory proposed by Cao and Ezawa [1], we define general-nondeterministic fuzzy pushdown automata (GN-FPDAs). For a GN-FPDA, the fuzzy transition function in a state may have more than one transitions labeled by the same input symbol and stack symbol, which apparently reflects nondeterminism. Here, it is also shown that the set of fuzzy languages accepted by GN-FPDAs by final states is coincide with that accepted by GN-FPDAs by empty stack. Amazingly, with help of the Pumping lemma of fuzzy context-free languages, we elaborate that GN-FPDAs accept more kinds of languages than common fuzzy pushdown automata. Furthermore, we introduce general-nondeterministic fuzzy context-free grammars (GN-FCFGs) and investigate the relationship between GN-FPDAs and GN-FCFGs. In addition, taking advantage of GN-FCFGs, the closure properties of operations, such as union, intersection, concatenation and Kleene closure, on the set of fuzzy languages accepted by GN-FPDAs are discussed in detail.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Similar content being viewed by others

References

  1. Cao, Y., Ezawa, Y.: Nondeterministic fuzzy automata. Inf. Sci. 191, 86–97 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Crisan, S., Tebrean, B.: Low cost, high quality vein pattern recognition device with liveness Detection. Workflow and implementations. Measurement 108, 207–216 (2017)

    Article  Google Scholar 

  3. Li, Y., Droste, M., Lei, L.: Model checking of linear-time properties in multi-valued systems. Inf. Sci. 377, 51–74 (2017)

    Article  MATH  Google Scholar 

  4. Yang, C., Li, Y.: \(\epsilon \)-bisimulation relations for fuzzy automata. IEEE Trans. Fuzzy Syst. 26(4), 2017–2029 (2018)

    Article  Google Scholar 

  5. Yang, C., Li, Y.: Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures. Fuzzy Sets Syst. 391(15), 72–95 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ying, M.: A formal model of computing with words. IEEE Trans. Fuzzy Syst. 10(5), 640–652 (2002)

    Article  Google Scholar 

  7. Nguyen, P.H.D., Tran, D.Q., Lines, B.C.: Empirical inference system for highway project delivery selection using fuzzy pattern recognition. J. Constr. Eng. Manag. 146, 04020141 (2020)

    Article  Google Scholar 

  8. Wee, W.G.: On Generalizations of Adaptive Algorithm and Application of the Fuzzy Sets Concept to Pattern Classification. Purdue University, West Lafayette (1967). https://dl.acm.org/doi/book/10.5555/905166

  9. Cao, Y., Chen, G., Kerre, E.: Bisimulations for fuzzy-transition systems. IEEE Trans. Fuzzy Syst. 19(3), 540–552 (2015)

    Article  Google Scholar 

  10. Li, Y.: Finite automata theory with membership values in lattices. Inf. Sci. 181(5), 1003–1017 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Li, Y., Shao, X., Tong, S.: Adaptive fuzzy prescribed performance control of non-triangular structure nonlinear systems. IEEE Trans. Fuzzy Syst. 28(10), 2416–2426 (2019)

    Article  Google Scholar 

  12. Lee, E.T., Zadeh, L.A.: Note on fuzzy languages. Inf. Sci. 1, 421–434 (1969)

    Article  MathSciNet  Google Scholar 

  13. Malik, D.S., Mordeson, J.N.: On fuzzy regular languages. Inf. Sci. 88(1–4), 263–273 (1994)

    MathSciNet  MATH  Google Scholar 

  14. Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages: Theory and Applications. Chapman & Hall/CRC, Boca Raton (2002). https://www.abe.pl/pl/book/9781584882251/fuzzy-automata-languages-theory-applications

  15. Bucurescu, I., Pascu, A.: Fuzzy pushdown automata. Int. J. Comput. Math. 10(2), 109–119 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  16. Clemente, L., Lasota, S.: Reachability relations of timed pushdown automata. J. Comput. Syst. Sci. 117, 202–241 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ghorani, M.: On characterization of fuzzy tree pushdown automata. Soft. Comput. 23, 1123–1131 (2019). https://doi.org/10.1007/s00500-017-2829-7

    Article  MATH  Google Scholar 

  18. Ghorani, M., Garhwal, S., Moghari, S.: Lattice-valued tree pushdown automata: pumping lemma and closure properties. Int. J. Approximate Reasoning 142, 301–323 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  19. Guillon, B., Pighizzini, G., Prigioniero, L.: Non-self-embedding grammars, constant-height pushdown automata, and limited automata. Int. J. Found. Comput. Sci. 31, 1133–1157 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  20. Jancar, P.: Equivalence of pushdown automata via first-order grammars. J. Comput. Syst. Sci. 115, 86–112 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kalra, N., Kumar, A.: Fuzzy state grammar and fuzzy deep pushdown automaton. J. Intell. Fuzzy Syst. 31(1), 249–258 (2016)

    Article  MATH  Google Scholar 

  22. Su, L.: Pushdown automata accepted fuzzy context free language. J. UEST China 21, 187–190 (1992)

    MathSciNet  Google Scholar 

  23. Wu, Q., Wang, X., Wang, Y.: Application of fuzzy pushdown automaton on prediction of quality control for spinning yarn. Inf. Technol. Control 50(1), 76–88 (2021)

    Article  Google Scholar 

  24. Xing, H.: Fuzzy pushdown automata. Fuzzy Sets Syst. 158(13), 1437–1449 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Xing, H., Qiu, D., Liu, F.: Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst. 160(8), 1125–1140 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  26. Han, Z., Li, Y.: Pushdown automata and context-free grammars based on quantum logic. J. Softw. 21(9), 2107–2117 (2010)

    MathSciNet  MATH  Google Scholar 

  27. Cao, Y., Ezawa, Y., Sun, S., Wang, H., Chen, G.: A behavioral distance for fuzzy-transition systems. IEEE Trans. Fuzzy Syst. 21(4), 735–747 (2013)

    Article  Google Scholar 

  28. Nithya, V., Senthilkumar, S.: Detection and avoidance of input validation attacks in web application using deterministic push down automata. J. Autom. Inf. Sci. 51(9), 32–51 (2019)

    Article  Google Scholar 

  29. Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. Log. Methods Comput. Sci. 2(1–2), 1–31 (2006)

    MathSciNet  MATH  Google Scholar 

  30. Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Berlin (2009). https://doi.org/10.1007/978-3-642-01492-5

    Book  MATH  Google Scholar 

  31. Li, T., Li, P.: Fuzzy Computing Theory. Academic Press, Beijing (2016)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  33. Li, Y., Wang, Q.: The universal fuzzy automaton. Fuzzy Sets Syst. 249, 27–48 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This paper was supported by the Research Project of the Fundamental Science (Natural Science) for Higher School in Jiangsu under Grant 21KJD520001.

Author information

Authors and Affiliations

  1. College of Information Engineering, Yangzhou University, Yangzhou, 225127, China

    Fangping Zhou & Chao Yang

Authors
  1. Fangping Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chao Yang .

Editor information

Editors and Affiliations

  1. National University of Defense Technology, Changsha, China

    Zhiping Cai

  2. Shanghai Jiao Tong University, Shanghai, China

    Yijia Chen

  3. Chinese Academy of Sciences, Beijing, China

    Jialin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, F., Yang, C. (2022). General-Nondeterministic Fuzzy Pushdown Automata and Their Languages. In: Cai, Z., Chen, Y., Zhang, J. (eds) Theoretical Computer Science. NCTCS 2022. Communications in Computer and Information Science, vol 1693. Springer, Singapore. https://doi.org/10.1007/978-981-19-8152-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-8152-4_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-8151-7

  • Online ISBN: 978-981-19-8152-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation