Skip to main content
Log in

Fuzzy grammar theory based on lattices

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this paper, on the basis of breadth-first and depth-first ways, we establish a fundamental framework of fuzzy grammars based on lattices, which provides a necessary tool for the analysis of fuzzy automata. The relationship among finite automata with membership values in lattices (l-VFAs), lattice-valued regular grammars (l-RGs) and lattice-valued deterministic regular grammars (l-DRGs) is investigated. It is demonstrated that, based on each semantic way, l-VFAs and l-RGs are equivalent in the sense that they accept or generate the same classes of fuzzy languages. Furthermore, it is proved that l-VFAs, l-valued deterministic finite automata, l-RGs and l-DRGs are equivalent based on depth-first way. For any l-RG, the language based on breadth-first way coincides with the language based on depth-first way if and only if the truth-valued domain l is a distributive lattice.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Cheng W, Wang J (2003) Grammar theory based on quantum logic. Internat J Theor Phys 42(8):1677–1691

    Article  MathSciNet  MATH  Google Scholar 

  • Depalma GF, Yau SS (1975) Fractional fuzzy grammars with application to pattern recognition. In: Zadeh LA, Fu KS, Tanaka K, Shimura M (eds) Fuzzy sets and their applications to cognitive and decision processes. Academic Press, New York, pp 329–351

    Google Scholar 

  • Gerla G (1992) Fuzzy grammars and recursively enumerable fuzzy languages. Inform Sci 60:137–143

    Article  MathSciNet  MATH  Google Scholar 

  • Giles C, Omlin C, Thorber KK (1999) Equivalence in knowledge representation: automata, recurrent neural networks, and dynamical fuzzy systems. Proc IEEE 87:1623–1640

    Article  Google Scholar 

  • Gudder S (2000) Basic properties of quantum automata. Found Phys 30:301–319

    Article  MathSciNet  Google Scholar 

  • Guo XH (2009) Gammar theory based on lattice-ordered monoid. Fuzzy Sets Syst 160:1152–1161

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Kim HH, Mizumoto M, Toyoda J, Tanaka K (1975) L-fuzzy grammar. Inform Sci 8:123–140

    Article  MathSciNet  MATH  Google Scholar 

  • Lee ET, Zadeh LA (1969) Note on fuzzy languages. Inform Sci 1:21–43

    Article  MathSciNet  Google Scholar 

  • Li YM, Pedrycz W (2005) Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst 156:68–92

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Moore C, Crutchfield J (2000) Quantum automata and quantum grammars. Theor Comput Sci 237:275–306

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  • Nielsen MA, Chuang IL (2000) Quantum computation and quantum information. Cambridge University Press, Cambridge

    MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Qiu DW (2004) Automata theory based on quantum logic: some characterizations. Inform Comput 190:179–195

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Qiu DW (2007) Notes on automata theory based on quantum logic. Sci China Ser F Inform Sci 50(2):154–169

    Article  MATH  Google Scholar 

  • Qiu DW, Ying MS (2004) Characterizations of quantum automata. Found Phys 312:479–480

    MathSciNet  MATH  Google Scholar 

  • Rabin MO, Scott D (1959) Finite automata and their decision problems. IBM J Res Develop 3:114–125

    Article  MathSciNet  Google Scholar 

  • Senay H (1992) Fuzzy command grammars for intelligent interface design. IEEE Trans Syst Man Cybernet 22:1124–1131

    Article  Google Scholar 

  • Sheng L, Li YM (2006) Regular grammars with truth values in lattice-ordered monoid and their languages. Soft Comput 10:79–86

    Article  MATH  Google Scholar 

  • Steimann F, Adlassning KP (1994) Clinical monitoring with fuzzy automata. Fuzzy Sets Syst 61:37–42

    Article  Google Scholar 

  • Ying MS (2005) A theory of computation based on quantum logic (I). Theor Comput Sci 344:134–207

    Article  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous referees for their careful reading of this paper and for a number of valuable comments which improved the quality of this paper. This work is supported by National Science Foundation of China (Grant No. 11071061) and 973 Program (2011CB311808).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianhua Jin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, J., Li, Q. Fuzzy grammar theory based on lattices. Soft Comput 16, 1415–1426 (2012). https://doi.org/10.1007/s00500-012-0845-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-012-0845-1

Keywords

Navigation