Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Weighted Automata Theory for Complexity Analysis of Rewrite Systems
Speaker:Georg Moser
coming from:University of Innsbruck
Speakers Bio:
Event Type:Talk
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Date, Time and Location
Date:Tuesday, 24 March 2015
Duration:60 Minutes
Building:E1 4
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.
Name(s):Jennifer Müller
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Created by:Jennifer Müller/MPI-INF, 03/03/2015 11:23 AMLast modified by:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Jennifer Müller, 03/03/2015 11:25 AM -- Created document.