Campus Event Calendar
Event Entry
What and Who
Weighted Automata Theory for Complexity Analysis of Rewrite Systems
Georg Moser
University of Innsbruck
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 24 March 2015
11:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
Matrix interpretations can be used to bound the derivational
and runtime complexity of term rewrite systems. In particular,
triangular matrix interpretations over the natural numbers are known
to induce polynomial upper bounds on the complexity of (compatible)
rewrite systems. Recently a couple of improvements were proposed,
based on the theory of weighted automata and linear algebra. In this
talk we focus on the application of weighted automata theory on the
runtime complexity analysis of rewrite systems and clarify the
connection to joint spectral radius theory.
The talk is based on joint work with Aart Middeldorp, Friedrich
Neurauter, Johannes Waldmann, and Harald Zankl.
and runtime complexity of term rewrite systems. In particular,
triangular matrix interpretations over the natural numbers are known
to induce polynomial upper bounds on the complexity of (compatible)
rewrite systems. Recently a couple of improvements were proposed,
based on the theory of weighted automata and linear algebra. In this
talk we focus on the application of weighted automata theory on the
runtime complexity analysis of rewrite systems and clarify the
connection to joint spectral radius theory.
The talk is based on joint work with Aart Middeldorp, Friedrich
Neurauter, Johannes Waldmann, and Harald Zankl.
Contact
Jennifer Müller
2900
--email hidden
passcode not visible
logged in users only
Jennifer Müller, 03/03/2015 11:25 -- Created document.