scientific article

zbMath1270.68132MaRDI QIDQ2843601

Aart Middeldorp

Publication date: 23 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S157106610480598X

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (9)

Unnamed Item ⋮ Tyrolean termination tool: techniques and features ⋮ On tree automata that certify termination of left-linear term rewriting systems ⋮ Mechanizing and improving dependency pairs ⋮ Unnamed Item ⋮ Automating the dependency pair method ⋮ Beyond Dependency Graphs ⋮ Context-sensitive dependency pairs ⋮ The size-change principle and dependency pairs for termination of term rewriting

This page was built for publication: