Skip to main content

Weighted Automata Over Valuation Monoids with Input and Multi-output Characteristics

  • Conference paper
  • First Online:
  • 549 Accesses

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

Abstract

Weighted automata are significant modelling notions of discrete dynamic systems. This paper aims to study weighted automata over valuation monoids with input and multi-output characteristics, whose truth values involve a wide range of algebraic structures such as semirings and strong bimonoids. In particular, if these domains are Cauchy double unital valuation monoids, it is pointed out that weighted sequential-like automata and weighted generalized Moore automata are equivalent in the sense of the same input and multi-output behaviors.

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 EPUB and 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

References

  1. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative Languages, in CSL 2008. LNCS. 5213, 385–400 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Chatterjee, K., Doyen, L., Henzinger, T.A.: Alternating weighted automata, in FCT 2009. LNCS. 5699, 3–13 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages pp. 199–208 (2009)

    Google Scholar 

  4. Chatterjee, K. , Doyen, L., Henzinger, T.A.: Probabilistic weighted automata. in CONCUR 2009, LNCS. 5710, 244–258 (2009)

    Google Scholar 

  5. Culik, K., Kari, J.: Image compression using weighted finite automata. Comput. Graph. 17, 305–313 (1993)

    Article  MathSciNet  Google Scholar 

  6. Droste, M., Stber, T., Vogler, H.: Weighted Finite Automata over Strong Bimonids. Inf. Sci. 180, 156–166 (2010)

    Article  Google Scholar 

  7. Droste, M., Meinecke, I.: Weighted automata and regular expressions over valuation monoids. Int. J. Found. Comput. Sci. 22, 1829–1844 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Knight, K., May, J.: Applications of Weighted Automata in Natural Language Processing. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 571–591. Springer, Berlin (2009)

    Chapter  Google Scholar 

  9. Li, Y.M., Pedrycz, W.: The Equivalence between Fuzzy Mealy and Fuzzy Moore Machines. Soft Comput. 10, 953–959 (2006)

    Article  MATH  Google Scholar 

  10. Li, Y.M.: Finite automata theory with membership values in lattices. Inf. Sci. 181, 1003–1017 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, F.: Diagnosability of fuzzy discrete-event systems: a fuzzy approach. IEEE Trans. Fuzzy Syst. 17(2), 372–384 (2009)

    Article  Google Scholar 

  12. Meinecke, I., Quaas, K.: Parameterized Model Checking of Weighted Networks. Theor. Comput. Sci. 534, 69–85 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mohri, M.: Finite-State Transducers in Language and Speech Processing. Comput Linguist. 23, 269–311 (1997)

    MathSciNet  Google Scholar 

  14. Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages: Theory and Applications. Chapman & Hall/CRC, Boca Raton (2002)

    Book  MATH  Google Scholar 

  15. Pan, H.Y., Li, Y.M., Cao, Y.Z., Ma, Z.Y.: Model Checking Computation Tree Logic over Finite Lattices. Theor. Comput. Sci. 612, 45–62 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. Santos, E.S.: Maximin automata. Inf. Control. 12, 367–377 (1968)

    Article  Google Scholar 

  17. Santos, E.S.: Max-product machines. J. Math. Anal. Appl. 37, 677–686 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  18. Santos, E.S., Wee, W.G.: General formulation of sequential machines. Inf. Control. 12(1), 5–10 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ushio, T., Takai, S.: Supervisory Control of Discrete Event Systems Modeled by Mealy Automata with Nondeterministic Output Functions. In: Proceedings of the American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June. 10–12(2009)

    Google Scholar 

  20. Ying, M.S.: A formal model of computing with words. IEEE Trans Fuzzy Syst. 10(5), 640–652 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  22. Zadeh, L.A.: Fuzzy languages and their relation to human and machine intelligence. Electronic Research Laboratory, University of California, Berkeley. Tech. Rep. ERL-M302 (1971)

    Google Scholar 

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China (Grant No. 11401495).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian-Hua Jin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Jin, JH., Li, DX., Li, CQ. (2017). Weighted Automata Over Valuation Monoids with Input and Multi-output Characteristics. In: Fan, TH., Chen, SL., Wang, SM., Li, YM. (eds) Quantitative Logic and Soft Computing 2016. Advances in Intelligent Systems and Computing, vol 510. Springer, Cham. https://doi.org/10.1007/978-3-319-46206-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46206-6_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46205-9

  • Online ISBN: 978-3-319-46206-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics