POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS

From MaRDI portal

Publication:5389155

Jump to:navigation, search

DOI10.4230/LIPIcs.RTA.2010.357zbMath1236.68155OpenAlexW1673970604MaRDI QIDQ5389155

Johannes Waldmann

Publication date: 25 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_1e7e.html

zbMATH Keywords

weighted automata finite domain constraints matrix interpretation ambiguity of automata derivational complexity of rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (6)

Unnamed Item ⋮ Uncurrying for termination and complexity ⋮ Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems ⋮ A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Analyzing innermost runtime complexity of term rewriting by dependency pairs

This page was built for publication: POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5389155&oldid=20115823"