Skip to main content
SpringerLink
Log in

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems

  • Conference paper
Algebraic Informatics (CAI 2011)

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

Included in the following conference series:

Abstract

Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known to induce polynomial upper bounds on the derivational complexity of (compatible) rewrite systems. Recently two different improvements were proposed, based on the theory of weighted automata and linear algebra. In this paper we strengthen and unify these improvements by using joint spectral radius theory.

This research is supported by FWF (Austrian Science Fund) project P20133. Friedrich Neurauter is supported by a grant of the University of Innsbruck.

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. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  2. Bell, J.: A gap result for the norms of semigroups of matrices. LAA 402, 101–110 (2005)

    MathSciNet  MATH  Google Scholar 

  3. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  4. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. JAR 40(2-3), 195–220 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gebhardt, A., Hofbauer, D., Waldmann, J.: Matrix evolutions. In: WST 2007, pp. 4–8 (2007)

    Google Scholar 

  6. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. I&C 205(4), 512–534 (2007)

    MathSciNet  MATH  Google Scholar 

  7. Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 364–379. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  9. Jungers, R.M., Protasov, V., Blondel, V.D.: Efficient algorithms for deciding the type of growth of products of integer matrices. LAA 428(10), 2296–2311 (2008)

    MathSciNet  MATH  Google Scholar 

  10. Jungers, R.: The Joint Spectral Radius: Theory and Applications. Springer, Heidelberg (2009)

    Book  Google Scholar 

  11. Koprowski, A., Waldmann, J.: Arctic termination...Below zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 202–216. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Moser, G.: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems. Habilitation thesis, University of Innsbruck (2009)

    Google Scholar 

  13. Moser, G., Schnabl, A.: The derivational complexity induced by the dependency pair method. LMCS (2011) (to appear), http://arxiv.org/abs/0904.0570

  14. Moser, G., Schnabl, A., Waldmann, J.: Complexity analysis of term rewriting based on matrix and context dependent interpretations. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2008. LIPIcs, vol. 2, pp. 304–315. Schloss Dagstuhl, Dagstuhl (2008)

    Google Scholar 

  15. Neurauter, F., Zankl, H., Middeldorp, A.: Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS(ARCoSS), vol. 6397, pp. 550–564. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Rose, H.E.: Linear Algebra: A Pure Mathematical Approach. Birkhäuser, Basel (2002)

    Book  MATH  Google Scholar 

  17. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  18. Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  19. Waldmann, J.: olynomially bounded matrix interpretations. In: Lynch, C. (ed.) RTA 2010. LIPIcs, vol. 6, pp. 357–372. Schloss Dagstuhl, Dagstuhl (2010)

    Google Scholar 

  20. Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. TCS 88(2), 325–349 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zankl, H., Korp, M.: Modular complexity analysis via relative complexity. In: Lynch, C. (ed.) RTA 2010. LIPIcs, vol. 6, pp. 385–400. Schloss Dagstuhl, Dagstuhl (2010)

    Google Scholar 

  22. Zankl, H., Middeldorp, A.: Satisfiability of non-linear (ir)rational arithmetic. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16. LNCS(LNAI), vol. 6355, pp. 481–500. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp, Georg Moser, Friedrich Neurauter & Harald Zankl

  2. Fakultät Informatik, Mathematik und Naturwissenschaften, Hochschule für Technik, Wirtschaft und Kultur Leipzig, Germany

    Johannes Waldmann

Authors
  1. Aart Middeldorp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Friedrich Neurauter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Johannes Waldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Harald Zankl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenberger Straße 69, 4040, Linz, Austria

    Franz Winkler

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Middeldorp, A., Moser, G., Neurauter, F., Waldmann, J., Zankl, H. (2011). Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. In: Winkler, F. (eds) Algebraic Informatics. CAI 2011. Lecture Notes in Computer Science, vol 6742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21493-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21493-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21492-9

  • Online ISBN: 978-3-642-21493-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation