Skip to main content
SpringerLink
Log in

On characterization of fuzzy tree pushdown automata

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

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.

Similar content being viewed by others

References

  • Abolpour KH, Zahedi MM (2012) Isomorphism between two BL-general fuzzy automata. Soft Comput 16(4):729–736

    Article  MATH  Google Scholar 

  • Bozapalidis S, Bozapalidoy OL (2010) Fuzzy tree language recognizability. Fuzzy Sets Syst 161:716–734

    Article  MathSciNet  MATH  Google Scholar 

  • Brainerd WS (1969) Tree generating regular systems. Inf Control 14:217–231

    Article  MathSciNet  MATH  Google Scholar 

  • Chaudhari SR, Joshi MN (2012) A note on fuzzy tree automata. Int J Comput Appl 56(17):1–5

    Google Scholar 

  • Chomsky N (1959) On certain formal properties of grammars. Inf control 2:137–167

    Article  MathSciNet  MATH  Google Scholar 

  • 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

  • Doner JE (1970) Tree acceptors and some of their applications. J Comput Syst Sci 4:406–451

    Article  MathSciNet  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 

  • Drewes F (2006) Grammatical picture generation. A tree-based approach, texts in theoretical computer science, an EATCS series. Springer, Berlin

    Google Scholar 

  • Ésik Z, Liu G (2007) Fuzzy tree automata. Fuzzy Sets Syst 158:1450–1460

    Article  MathSciNet  MATH  Google Scholar 

  • Ghorani M, Zahedi MM (2012) Characterizations of complete residuated lattice-valued finite tree automata. Fuzzy Sets Syst 199:28–46

    Article  MathSciNet  MATH  Google Scholar 

  • Ghorani M, Zahedi MM (2016) Alternating regular tree grammars in the framework of lattice-valued logic. Iran J Fuzzy Syst 13(2):71–94

    MathSciNet  MATH  Google Scholar 

  • Ghorani M, Zahedi MM (2017) Coding tree languages based on lattice valued logic. Soft Comput 21(14):3815–3825

  • Ghorani M, Zahedi MM, Ameri R (2012) Algebraic properties of complete residuated lattice valued tree automata. Soft Comput 16(10):1723–1732

    Article  MATH  Google Scholar 

  • Gilleron R, Tison S, Tommasi M (1993) Solving systems of set constraints using tree automata. Lect Notes Comput Sci 665:505–514

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • 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–328

  • Lan S (1992) A machine accepted fuzzy context-free languages-fuzzy pushdown automata. BUSEFAL 49:67–72

    Google Scholar 

  • Lee ET, Zadeh LA (1969) Note on fuzzy languages. Inf Sci 1:421–434

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Li YM, Ma ZY (2015) Quantitative computational tree logic model checking based on generalized possibility measures. IEEE Trans Fuzzy Syst 23(6):2034–2047

    Article  Google Scholar 

  • Li L, Qiu D (2015) On the state minimization of fuzzy automata. IEEE Trans Fuzzy Syst 23(2):434–443

    Article  Google Scholar 

  • Li YM, Li YL, Ma ZY (2015) Computation tree logic model checking based on possibility measures. Fuzzy Sets Syst 262:44–59

    Article  MathSciNet  MATH  Google Scholar 

  • Mezei J, Wright JB (1967) Algebraic automata and context-free sets. Inf Control 11:3–29

    Article  MathSciNet  MATH  Google Scholar 

  • Moghari S, Zahedi MM, Ameri R (2011) New direction in fuzzy tree automata. Iran J Fuzzy Syst 8(5):59–68

    MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  • Nidhi K, Ajay K (2016) Fuzzy state grammar and fuzzy deep pushdown automaton. J Intell Fuzzy Syst 31(1):249–258

    Article  MATH  Google Scholar 

  • Pan PY, Li YM, Cao YZ, Ma ZY (2015) Model checking fuzzy computation tree logic. Fuzzy Sets Syst 262:60–77

  • Pan HY, Li YM, Cao YZ, Ma ZY (2016) Model checking computation tree logic over finite lattices. Theor Comput Sci 612:45–62

    Article  MathSciNet  MATH  Google Scholar 

  • Qiu DW (2004) Characterizations of fuzzy finite automata. Fuzzy Sets Syst 141:391–414

    Article  MathSciNet  MATH  Google Scholar 

  • Salomaa K (1988) Deterministic tree pushdown automata and monadic tree rewriting systems. J Comput Syst Sci 37(3):367–394

    Article  MathSciNet  MATH  Google Scholar 

  • Santos ES (1968) Maximin automata. Inf Control 12:367–377

    Article  MathSciNet  MATH  Google Scholar 

  • Santos ES (1972) On reduction of maxmin machines. J Math Anal Appl 37:677–686

    Article  MathSciNet  Google Scholar 

  • Schimpf KM (1982) A parsing method for context-free tree languages. Ph.D. dissertation, University of Pennsylvania, Philadelphia, PA

  • Schimpf KM, Gallier JH (1985) Tree pushdown automata. J Comput Syst Sci 30(1):25–40

    Article  MathSciNet  MATH  Google Scholar 

  • Schwentick T (2007) Automata for XMLA survey. J Comput Syst Sci 73(3):289–315

    Article  MathSciNet  MATH  Google Scholar 

  • Shamsizadeh M, Zahedi MM (2016) Intuitionistic general fuzzy automata. Soft Comput 20(9):3505–3519

    Article  MATH  Google Scholar 

  • 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–81

    Article  MathSciNet  MATH  Google Scholar 

  • Thomason MG, Marinos PN (1974) Deterministic acceptors of regular fuzzy languages. IEEE Trans Syst Man Cybern 4:228–230

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • 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–223

    MATH  Google Scholar 

  • Xing HY (2007) Fuzzy pushdown automata. Fuzzy Sets Syst 158(13):1437–1449

    Article  MathSciNet  MATH  Google Scholar 

  • 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–1151

    Article  MathSciNet  MATH  Google Scholar 

  • Xing HY, Qiu DW, Liu FC (2009) Automata theory based on complete residuated lattice-valued logic: pushdown automata. Fuzzy Sets Syst 160(8):1125–1140

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang X, Li Y (2009) Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata. Soft Comput 13(6):611–616

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran

    M. Ghorani

Authors
  1. M. Ghorani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Ghorani.

Ethics declarations

Conflict of interest

The author declares that she has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by the author.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2829-7

Keywords

Search

Navigation