Complexity analysis for term rewriting by integer transition systems

DOI10.1007/978-3-319-66167-4_8zbMath1495.68116OpenAlexW2739906175MaRDI QIDQ1687548

Carsten Fuhs, Matthias Naaf, Marc Brockschmidt, Florian Frohn, Jürgen Giesl

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66167-4_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (1)

Analysing parallel complexity of term rewriting

Uses Software

• AProVE
• ABC
• TcT

This page was built for publication: Complexity analysis for term rewriting by integer transition systems