On characterization of fuzzy tree pushdown automata

Methodologies and Application
  • 27 Downloads

Abstract

This paper introduces the concepts of fuzzy tree pushdown automata and fuzzy context-free tree grammars. At first, we show that any fuzzy context-free tree grammar can be converted into a corresponding definition of fuzzy Chomsky normal form for trees. Then, the relation between a fuzzy context-free tree grammar and a fuzzy tree pushdown automaton is investigated. In fact, we show that the class of languages accepted by fuzzy tree pushdown automata is identical to the one generated by fuzzy context-free tree grammars. Some examples are given to clarify the results.

Keywords

Fuzzy tree pushdown automata Fuzzy context-free tree grammar Fuzzy Chomsky normal form Fuzzy tree language 

References

  1. Abolpour KH, Zahedi MM (2012) Isomorphism between two BL-general fuzzy automata. Soft Comput 16(4):729–736CrossRefMATHGoogle Scholar
  2. Bozapalidis S, Bozapalidoy OL (2010) Fuzzy tree language recognizability. Fuzzy Sets Syst 161:716–734MathSciNetCrossRefMATHGoogle Scholar
  3. Brainerd WS (1969) Tree generating regular systems. Inf Control 14:217–231MathSciNetCrossRefMATHGoogle Scholar
  4. Chaudhari SR, Joshi MN (2012) A note on fuzzy tree automata. Int J Comput Appl 56(17):1–5Google Scholar
  5. Chomsky N (1959) On certain formal properties of grammars. Inf control 2:137–167MathSciNetCrossRefMATHGoogle Scholar
  6. Comon H, Dauchet M, Gilleron R, Jacquemard F, Lugiez D, Loding C, Tison S, Tommasi M (2007) Tree automata: techniques and applications. http://tata.gforge.inria.fr
  7. Doner JE (1970) Tree acceptors and some of their applications. J Comput Syst Sci 4:406–451MathSciNetCrossRefMATHGoogle Scholar
  8. Doostfatemeh M, Kremer SC (2005) New directions in fuzzy automata. Int J Approx Reason 38:175–214MathSciNetCrossRefMATHGoogle Scholar
  9. Drewes F (2006) Grammatical picture generation. A tree-based approach, texts in theoretical computer science, an EATCS series. Springer, BerlinGoogle Scholar
  10. Ésik Z, Liu G (2007) Fuzzy tree automata. Fuzzy Sets Syst 158:1450–1460MathSciNetCrossRefMATHGoogle Scholar
  11. Ghorani M, Zahedi MM (2012) Characterizations of complete residuated lattice-valued finite tree automata. Fuzzy Sets Syst 199:28–46MathSciNetCrossRefMATHGoogle Scholar
  12. Ghorani M, Zahedi MM (2016) Alternating regular tree grammars in the framework of lattice-valued logic. Iran J Fuzzy Syst 13(2):71–94MathSciNetMATHGoogle Scholar
  13. Ghorani M, Zahedi MM (2017) Coding tree languages based on lattice valued logic. Soft Comput 21(14):3815–3825Google Scholar
  14. Ghorani M, Zahedi MM, Ameri R (2012) Algebraic properties of complete residuated lattice valued tree automata. Soft Comput 16(10):1723–1732CrossRefMATHGoogle Scholar
  15. Gilleron R, Tison S, Tommasi M (1993) Solving systems of set constraints using tree automata. Lect Notes Comput Sci 665:505–514MathSciNetCrossRefMATHGoogle Scholar
  16. Ignjatovic J, Ćirić M, Bogdanovic S (2008) Determinization of fuzzy automata with membership values in complete residuated lattices. Inf Sci 178:164–180MathSciNetCrossRefMATHGoogle Scholar
  17. Inagaki Y, Fukumura T (1975) On the description of fuzzy meaning of context-free language. In: Fuzzy sets and their applications to cognitive and decision processes, Proceedings of U.S. Japan Seminar, University of California, Berkeley, CA, 1974, Academic Press, New York, pp. 301–328Google Scholar
  18. Lan S (1992) A machine accepted fuzzy context-free languages-fuzzy pushdown automata. BUSEFAL 49:67–72Google Scholar
  19. Lee ET, Zadeh LA (1969) Note on fuzzy languages. Inf Sci 1:421–434MathSciNetCrossRefGoogle Scholar
  20. Li Y (2011) Finite automata theory with membership values in lattices. Inf Sci 181(5):1003–1017MathSciNetCrossRefMATHGoogle Scholar
  21. Li YM, Ma ZY (2015) Quantitative computational tree logic model checking based on generalized possibility measures. IEEE Trans Fuzzy Syst 23(6):2034–2047CrossRefGoogle Scholar
  22. Li L, Qiu D (2015) On the state minimization of fuzzy automata. IEEE Trans Fuzzy Syst 23(2):434–443CrossRefGoogle Scholar
  23. Li YM, Li YL, Ma ZY (2015) Computation tree logic model checking based on possibility measures. Fuzzy Sets Syst 262:44–59MathSciNetCrossRefMATHGoogle Scholar
  24. Mezei J, Wright JB (1967) Algebraic automata and context-free sets. Inf Control 11:3–29MathSciNetCrossRefMATHGoogle Scholar
  25. Moghari S, Zahedi MM, Ameri R (2011) New direction in fuzzy tree automata. Iran J Fuzzy Syst 8(5):59–68MathSciNetMATHGoogle Scholar
  26. Mordeson JN, Malik DS (2002) Fuzzy automata and languages: theory and applications. Chapman & Hall CRC, LondonCrossRefMATHGoogle Scholar
  27. Nidhi K, Ajay K (2016) Fuzzy state grammar and fuzzy deep pushdown automaton. J Intell Fuzzy Syst 31(1):249–258CrossRefMATHGoogle Scholar
  28. Pan PY, Li YM, Cao YZ, Ma ZY (2015) Model checking fuzzy computation tree logic. Fuzzy Sets Syst 262:60–77Google Scholar
  29. Pan HY, Li YM, Cao YZ, Ma ZY (2016) Model checking computation tree logic over finite lattices. Theor Comput Sci 612:45–62MathSciNetCrossRefMATHGoogle Scholar
  30. Qiu DW (2004) Characterizations of fuzzy finite automata. Fuzzy Sets Syst 141:391–414MathSciNetCrossRefMATHGoogle Scholar
  31. Salomaa K (1988) Deterministic tree pushdown automata and monadic tree rewriting systems. J Comput Syst Sci 37(3):367–394MathSciNetCrossRefMATHGoogle Scholar
  32. Santos ES (1968) Maximin automata. Inf Control 12:367–377MathSciNetCrossRefMATHGoogle Scholar
  33. Santos ES (1972) On reduction of maxmin machines. J Math Anal Appl 37:677–686MathSciNetCrossRefGoogle Scholar
  34. Schimpf KM (1982) A parsing method for context-free tree languages. Ph.D. dissertation, University of Pennsylvania, Philadelphia, PAGoogle Scholar
  35. Schimpf KM, Gallier JH (1985) Tree pushdown automata. J Comput Syst Sci 30(1):25–40MathSciNetCrossRefMATHGoogle Scholar
  36. Schwentick T (2007) Automata for XMLA survey. J Comput Syst Sci 73(3):289–315MathSciNetCrossRefMATHGoogle Scholar
  37. Shamsizadeh M, Zahedi MM (2016) Intuitionistic general fuzzy automata. Soft Comput 20(9):3505–3519CrossRefMATHGoogle Scholar
  38. Thatcher JW, Wright JB (1968) Generalized finite automata theory with an application to a decision-problem of second order logic. Math Syst Theory 2:57–81MathSciNetCrossRefMATHGoogle Scholar
  39. Thomason MG, Marinos PN (1974) Deterministic acceptors of regular fuzzy languages. IEEE Trans Syst Man Cybern 4:228–230MathSciNetCrossRefMATHGoogle Scholar
  40. Wang J, Yin M, Gu W (2013) Fuzzy multiset finite automata and their languages. Soft Comput 17(3):381–390CrossRefMATHGoogle Scholar
  41. Wee WG, Fu KS (1969) A formulation of fuzzy automata and its application as a model of learning systems. IEEE Trans Syst Man Cybern 5:215–223MATHGoogle Scholar
  42. Xing HY (2007) Fuzzy pushdown automata. Fuzzy Sets Syst 158(13):1437–1449MathSciNetCrossRefMATHGoogle Scholar
  43. Xing HY, Qiu DW (2009) Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 160(8):1141–1151MathSciNetCrossRefMATHGoogle Scholar
  44. Xing HY, Qiu DW, Liu FC (2009) Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst 160(8):1125–1140MathSciNetCrossRefMATHGoogle Scholar
  45. Zhang X, Li Y (2009) Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata. Soft Comput 13(6):611–616CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Faculty of Mathematical SciencesShahrood University of TechnologyShahroodIran

Personalised recommendations