Skip to main content

Minimization of Lattice-Valued Moore Type of Finite Automaton

  • Conference paper
  • 1615 Accesses

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 147))

Abstract

The definitions are given about Lattice-valued Moore type of finite automaton and lattice-valued fuzzy Moore type of finite automaton. Some related properties of them are discussed. Moreover, the minimization of fuzzy Moore automaton is also investigated based on state weak equivalence relations. Finally, some significant results concerning of them are given systematically.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Wee, W.G.: On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification. Ph. D. Thesis, Purdue University (1967)

    Google Scholar 

  3. Santos, E.S.: Maximin automata. Inform. Control 13, 363–377 (1968)

    Article  MATH  Google Scholar 

  4. Asai, K., Kitajima, S.: A method for optimizing control of multimodal systems using fuzzy automata. Inform. Sci. 3, 343–353 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dubois, D., Prade, H.: Fuzzy sets and systems: theory and application. Academic Press, New York (1980)

    Google Scholar 

  6. Kandel, A., Lee, S.C.: Fuzzy switching and automata: theory and application. Crane & Russak, Edward Arnord, New York, London (1979)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Cheng, W., Mo, Z.W.: A kind of classification of fuzzy finite automata. Busefal 84, 51–55 (2000)

    Google Scholar 

  9. Ying, M.S.: A formal model of computing with words. IEEE Transactions on Fuzzy Systems 10, 642–652 (2002)

    Google Scholar 

  10. Wang, Y., Mo, Z.M.: Minimization of mealy lattice finite automata based on fuzzy strings. Fuzzy Systems and Mathematics 23, 50–55 (2009)

    MathSciNet  Google Scholar 

  11. Wang, Y., Yang, Q.: Minimization of mizumoto lattice finite automata. Journal of Frontiers of Computer Science and Technology 3, 441–446 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kun Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, K., Mo, Zw. (2012). Minimization of Lattice-Valued Moore Type of Finite Automaton. In: Cao, BY., Xie, XJ. (eds) Fuzzy Engineering and Operations Research. Advances in Intelligent and Soft Computing, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28592-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28592-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28591-2

  • Online ISBN: 978-3-642-28592-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics