Skip to main content
SpringerLink
Log in

Weighted Automata and Weighted Logics on Infinite Words

  • Conference paper
Developments in Language Theory (DLT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4036))

Included in the following conference series:

Abstract

We introduce weighted automata over infinite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A.: Finite transition systems. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

  2. Balbes, R., Dwinger, P.: Distributive Lattices. University of Missouri Press (1974)

    Google Scholar 

  3. Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs in Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)

    Google Scholar 

  4. Bloom, S.L., Ésik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)

    Google Scholar 

  5. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlager Math. 6, 66–92 (1960)

    Article  MATH  Google Scholar 

  6. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)

    Google Scholar 

  7. Culik II, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics 17, 305–313 (1993)

    Article  Google Scholar 

  8. Culik, K., Karhumäki, J.: Finite automata computing real functions. SIAM J. Comput. 23(4), 789–814 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Droste, M., Gastin, P.: On aperiodic and star-free formal power series in partially commuting variables. In: Proceedings of FPASAC 2000, pp. 158–169. Springer, Heidelberg (2000), full version: Research Report LSV-05, ENS de Cachan, France (2005)

    Google Scholar 

  10. Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 513–525. Springer, Heidelberg (2005); full version in:, http://www.informatik.uni-leipzig.de/theo/pers/droste/publications.html

  11. Droste, M., Kuske, D.: Skew and infinitary formal power series. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 426–438. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Droste, M., Püschmann, U.: Weighted Büchi Automata (submitted)

    Google Scholar 

  13. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  14. Elgot, C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–52 (1961)

    Article  MathSciNet  Google Scholar 

  15. Ésik, Z., Kuich, W.: On iteration semiring-semimodule pairs (to appear)

    Google Scholar 

  16. Ésik, Z., Kuich, W.: A semiring-semimodule generalization of ω-regular languages I and II. Special issue on Weighted automata. Droste, M., Vogler, H. (eds.) J. of Automata Languages and Combinatorics (to appear)

    Google Scholar 

  17. Hafner, U.: Low Bit-Rate Image and Video Coding with Weighted Finite Automata. PhD thesis, Universität Würzburg, Germany (1999)

    Google Scholar 

  18. Jiang, Z., Litow, B., de Vel, O.: Similarity enrichment in image compression through weighted finite automata. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 447–456. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  19. Katritzke, F.: Refinements of data compression using weighted finite automata. PhD thesis, Universität Siegen, Germany (2001)

    Google Scholar 

  20. Krithivasan, K., Sharda, K.: Fuzzy ω-automata. Inf. Sci. 138, 257–281 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 609–677. Springer, Heidelberg (1997)

    Google Scholar 

  22. Kuich, W.: On skew formal power series. In: Bozapalidis, S., Kalampakas, A., Rahonis, G. (eds.) Proceedings of the Conference on Algebraic Informatics. Thessaloniki, pp. 7–30 (2005)

    Google Scholar 

  23. Kuich, W., Rahonis, G.: Fuzzy regular languages over finite and infinite words. Fuzzy Sets and Systems (to appear)

    Google Scholar 

  24. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs in Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)

    Google Scholar 

  25. Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes. Princeton Series in Computer Science. Princeton University Press, Princeton (1994)

    Google Scholar 

  26. McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  27. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23, 269–311 (1997)

    MathSciNet  Google Scholar 

  28. Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoret. Comput. Sci. 231, 17–32 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  29. Perrin, D., Pin, J.E.: Infinite Words. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  30. Rahonis, G.: Infinite fuzzy computations. Fuzzy Sets and Systems 153, 275–288 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  31. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)

    MATH  Google Scholar 

  32. Schützenberger, M.: On the definition of a family of automata. Inf. Control 4, 245–270 (1961)

    Article  MATH  Google Scholar 

  33. Thomas, W.: Automata on infinite objects. In: Leeuwen, J.v. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 135–191. Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  34. Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–485. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, D-04109, Leipzig, Germany

    Manfred Droste

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Authors
  1. Manfred Droste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Rahonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, WA 99164, Pullman, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Droste, M., Rahonis, G. (2006). Weighted Automata and Weighted Logics on Infinite Words. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_6

Download citation

  • DOI: https://doi.org/10.1007/11779148_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation