Skip to main content
SpringerLink
Log in

Algebraic properties on the cuts of lattice-valued regular languages

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

Abstract

In this paper, the algebraic operations on the cuts of lattice-valued regular languages are studied. Some sufficient conditions are given to guarantee the family of the cuts of lattice-valued regular languages to be closed under such algebraic operations as union, intersection, complement, quotient, homomorphism, inverse homomorphism, concatennation, reversal, etc.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Asveld PRJ (2003) Algebraic aspects of fuzzy languages. Theor Comput Sci 293: 417–445

    Article  MATH  MathSciNet  Google Scholar 

  • Holcobe WM (1982) Algebraic automata theory. Cambridge University Press, Cambridge

    Google Scholar 

  • Hopcroft JE, Ullman JD (1979) Introduction to automata therory, languages and computation. Addson-Wesley, New York

    Google Scholar 

  • Kumbhojkar HV, Chdhari SR (2002) Fuzzy recognizers and recognizable sets. Fuzzy Sets Syst 3: 381–391

    Article  Google Scholar 

  • Li P, Li YM (2006) Algebraic properties of LA-languages. Inf Sci 176: 3232–3255

    Article  MATH  Google Scholar 

  • Li YM (2005) Analysis of fuzzy system. Science Press, Beijing

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Li YM, Pedrycz W (2006) The equivalence between fuzzy Mealy and fuzzy Moore machines. Soft Comput 10: 953–959

    Article  MATH  Google Scholar 

  • Li YM, Li ZH (1993) Free semilattices and strongly free semittices generated by partially ordered sets. Northeastern Math J 9(3): 359–366

    MATH  Google Scholar 

  • Li ZH, Li P, Li YM (2006) The relationships among several types of fuzzy automata. Inf Sci 176: 2208–2226

    Article  MATH  Google Scholar 

  • Mateescu A, Salomaa A (1995) Lexical analysis with a simple finite-fuzzy-automaton model. J Univ Comput Sci 1(5): 292–311

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  • Shen JZ (1996) Fuzzy language on free monoid. Inf Sci 88: 149–168

    Article  MATH  Google Scholar 

  • Wechler W (1978) The concept of fuzziness in automata and language theory. Addison-Wesley, Reading

    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 Cyber 5: 215–233

    Article  Google Scholar 

  • Zadeh LA (1965) Fuzzy sets. Inf Control 8: 338–355

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Information Science, Shaanxi Normal University, Xi’an, 710062, China

    Changjian Liang & Yongming Li

  2. College of Software, Shangqiu Normal University, Shangqiu, 476000, China

    Changjian Liang

  3. College of Computer Science, Shaanxi Normal University, Xi’an, 710062, China

    Yongming Li

Authors
  1. Changjian Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changjian Liang.

Additional information

This work is supported by National Science Foundation of China (Grant No.10571112), “TRAPOYT” of China and National 973 Foundation Research Program (Grant No. 2002CB312200).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, C., Li, Y. Algebraic properties on the cuts of lattice-valued regular languages. Soft Comput 12, 1049–1057 (2008). https://doi.org/10.1007/s00500-007-0271-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-007-0271-y

Keywords

Search

Navigation