Complexity analysis of term-rewriting systems

DOI10.1016/0304-3975(89)90005-4zbMath0686.68031OpenAlexW4210427257MaRDI QIDQ1262761

K. Appert

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00075687/file/RR-0867.pdf

zbMATH Keywords

algorithmic complexityterm rewriting systemsasymptotic evaluations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65)

Related Items (7)

A combination framework for complexity ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Automatic average-case analysis of algorithms ⋮ Average-case analysis on simple families of trees using a balanced probability model ⋮ Unnamed Item ⋮ Analytic analysis of algorithms ⋮ Unnamed Item

Uses Software

• Maple

Cites Work

• Orderings for term-rewriting systems
• Report on the Larch shared language
• A Larch shared language handbook
• Complexity of algebraic implementations for abstract data types
• Patterns and pattern-matching in trees: An analysis
• A complexity calculus for recursive tree algorithms
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of term-rewriting systems