Skip to main content

Lattice-Semigroups Tree Automation’s Congruence and Homomorphism

  • Chapter
  • First Online:
Fuzzy Information & Engineering and Operations Research & Management

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 211))

  • 1233 Accesses

Abstract

The partial order of lattice elements in lattice-semigroup tree automata(LSTA) is defined in this paper. We proved the existence of semilattices and also lattices formed by different types of LSTA. Finally, we investigate the congruence and homomorphism of lattice-semigroup by LSTA formed from the algebra angle, Then we obtain homomorphism fundamental theorem of the LSTA.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  2. Inagaki, Y., Fukumura, T.: On the description of fuzzy meaning of context-free language. In: Fuzzy Sets and their Applications to Cognitive and Decision Processes. Proceedings of the U.S.-Japan Seminar, University of California, Berkeley, CA, 1974. Academic Press, New York, pp. 301–328 (1975)

    Google Scholar 

  3. Qiu, D.W.: Automata theory based on complete residuated lattice-valued logic. Sci. China(F) 45(6), 442–452 (2002)

    Google Scholar 

  4. Qiu, D.W.: Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note. Fuzzy Sets Syst. 2128–2138 (2006)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Lu, R.Q., Zheng, H.: Lattices of quantum automata. Int. J. Theor. Phys. 1425–1449 (2003)

    Google Scholar 

  7. GUO, X.H., Mo, Z.W.: Homomorphisms in lattices of quantum automata. J. Sichuan Normal Univ. (Nat. Sci.) 635–638 (2005)

    Google Scholar 

  8. Huang, X.F., Mo, Z.W.: Some algebraic properties on lattice semigroup tree automata. Fuzzy Syst. Math. (To appear)

    Google Scholar 

  9. Xie, X.Y.: Ordered semigroup introduce. Science Press, pp. 9–10 (2001)

    Google Scholar 

Download references

Acknowledgments

The authors are very grateful to the anonymous referee for his/her careful review and constructive suggestions.This work is supported by the National Natural Science Foundation of China (Grant No.11071178), the Research Foundation of the Education Department of Sichuan Province (Grant No. 12ZB106) and the Research Foundation of Sichuan Normal University (Grant No. 10MSL06).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao-feng Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Huang, Xf., Mo, Zw. (2014). Lattice-Semigroups Tree Automation’s Congruence and Homomorphism. In: Cao, BY., Nasseri, H. (eds) Fuzzy Information & Engineering and Operations Research & Management. Advances in Intelligent Systems and Computing, vol 211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38667-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38667-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38666-4

  • Online ISBN: 978-3-642-38667-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics