Skip to main content

Lattice Minimal Automata and Lattice Reduced Automata

  • Conference paper
  • 1057 Accesses

Part of the book series: Advances in Soft Computing ((AINSC,volume 54))

Abstract

We apply lattice ordered monoids in the study of lattice finite automata, and obtain some results similar to the ones of fuzzy finite automata. In this paper, the concepts of lattice minimal automata and lattice reduced automata are put forward, and the relationship of them associated with an L-language is discussed. Moreover, the L-fuzzy equivalence relation on states is defined, and an algorithm to minimize the lattice finite automata is presented based on clustering states.

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. Information Control 8, 338–353 (1965)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic(I). Science in China, Series F44 6, 419–429 (2001)

    Google Scholar 

  4. Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic(II). Science in China, Series F45 6, 442–452 (2002)

    Google Scholar 

  5. 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  MATH  MathSciNet  Google Scholar 

  6. Cheng, W., Mo, Z.W.: Minimization algorithm of fuzzy finite automata. Fuzzy Sets and Systems 141, 439–448 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mo, Z.W., Peng, J.Y.: Fuzzy minimal automaton and reduced fuzzy automaton. Journal of Sichuan Normal University, Series 25(6), 585–587 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Horng, M.S.: State minimization of fuzzy automaton, pp. 1946–1949. IEEE, Los Alamitos (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Mo, Zw. (2009). Lattice Minimal Automata and Lattice Reduced Automata. In: Cao, By., Zhang, Cy., Li, Tf. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 54. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88914-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88914-4_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88913-7

  • Online ISBN: 978-3-540-88914-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics