Skip to main content
Springer Nature Link
Log in

Coding tree languages based on lattice-valued logic

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

Abstract

We consider tree automata based on complete residuated lattice-valued (for simplicity we write L-valued) logic. First, we define the concepts of response function and accessible states (with threshold c) of an L-valued tree automaton. Thereafter, we consider coding of trees and investigate the relation between response function on trees and their coding. Using the provided theorems, we give a pumping lemma for recognizable coding tree languages with threshold c. Moreover, we consider closure properties of recognizable coding tree languages. In this regard, we show that the class of recognizable coding tree languages with threshold c is closed under projection, intersection and union.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

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

    Article  MATH  Google Scholar 

  • Birkhoff G (1984) Lattice theory. American Mathematical Society, Providence

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Comon H, Dauchet M, Gilleron R, Jacquemard F, Lugiez D, Loding C, Tison S, Tommasi M (2007) Tree automata: technigues and applications. http://tata.gforge.inria.fr

  • Doner JE (1965) Decidability of the weak second-order theory of two successors. Not Am Math Soc 12:365–468

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Gecseg F, Steinby M (1984) Tree automata. Akademiai Kiado, Budapest

    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, Ameri R (2012) Algebraic properties of complete residuated lattice valued tree automata. Soft Comput 16(10):1723–1732

    Article  MATH  Google Scholar 

  • Gupta MM, Saridis GN, Gaines BR (1977) Fuzzy automata and decision processes. North-Holland, New York

    MATH  Google Scholar 

  • Hopcroft JE, Motwani R, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, New York

    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. Proc. U.S. Japan seminar. University of California, Berkeley, Academic Press, New York, pp 301–328

  • Jin J, Li Q (2012) Fuzzy grammar theory based on lattices. Soft Comput 16(8):1415–1426

    Article  MATH  Google Scholar 

  • Lei HX, Li Y (2007) Minimization of states in automata theory based on finite lattice-ordered monoids. Inf Sci 177:1413–1421

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Li Y, Wang Q (2013) The universal fuzzy automata. Fuzzy Sets Syst 249(16):2748

    Google Scholar 

  • Liang C, Li Y (2008) Algebraic properties on the cuts of lattice-valued regular languages. Soft Comput 12(11):1049–1057

    Article  MATH  Google Scholar 

  • Lu X, Shang Y, Lu R (2011) Automata theory based on lattice-ordered semirings. Soft Comput 15:269–280

    Article  MATH  Google Scholar 

  • Malik DS, Mordeson JN (2000) Fuzzy discrete structures. Physica-Verlag, New York

    Book  MATH  Google Scholar 

  • Mockor J (2002) Semigroup homomorphisms and fuzzy automata. Soft Comput 6:422–427

    Article  MATH  Google Scholar 

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

  • Pavelka J (1979a) On fuzzy logic I: many-valued rules of inferences. Z Math Logik Grundlagen Math 25:45–52

    Article  MathSciNet  MATH  Google Scholar 

  • Pavelka J (1979b) On fuzzy logic II: enriched residuated lattices and semantics of propositional calculi. Z Math Logik Grundlagen Math 25:119–134

    Article  MathSciNet  MATH  Google Scholar 

  • Pavelka J (1979c) On fuzzy logic III: semantical completeness of some many-valued propositional calculi. Z Math Logik Grundlagen Math 25:447–464

    Article  MathSciNet  MATH  Google Scholar 

  • Qiu DW (2001) Automata theory based on completed residuated lattice-valued logic (I). Sci China (Ser F) 44(6):419–429

    MathSciNet  MATH  Google Scholar 

  • Qiu DW (2002) Automata theory based on completed residuated lattice-valued logic (II). Sci China (Ser F) 45(6):442–452

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Qiu DW (2006) Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note. Fuzzy Sets Syst 157:2128–2138

    Article  MathSciNet  MATH  Google Scholar 

  • Shang Y, Lu R (2007) Semirings and pseudo MV algebras. Soft Comput 11:847–853

    Article  MATH  Google Scholar 

  • Thatcher JW, Wright JB (1968) Generalized finite automata with an application to a decision problem of second-order logic. Math Syst Theory 2:57–82

    Article  MathSciNet  MATH  Google Scholar 

  • Wechler W (1978) The concept of fuzziness in automata and language theory. Akademie-Verlag, Berlin

    MATH  Google Scholar 

  • Wu L, Qiu DW (2010) Automata theory based on completed residuated lattice-valued logic: reduction and minimization. Fuzzy Sets Syst 161:1635–1656

    Article  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: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:1125–1140

    Article  MathSciNet  MATH  Google Scholar 

  • Xing HY, Qiu DW, Liu FC, Fan ZJ (2007) Equivalence in automata theory based on complete residuated lattice-valued logic. Fuzzy Sets Syst 158:1407–1422

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    M. Ghorani

  2. Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran

    M. M. Zahedi

Authors
  1. M. Ghorani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. M. Zahedi
    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 authors declare that there is no conflict of interest.

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., Zahedi, M.M. Coding tree languages based on lattice-valued logic. Soft Comput 21, 3815–3825 (2017). https://doi.org/10.1007/s00500-016-2031-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2031-3

Keywords

Search

Navigation