On the descriptive power of term rewriting systems

DOI10.1016/S0747-7171(86)80017-7zbMath0614.68032MaRDI QIDQ1819932

Jürgen Avenhaus

Publication date: 1986

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

string rewriting systemsdescriptive power of term rewriting systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65)

Related Items

Algebraic semantics and complexity of term rewriting systems

Cites Work

• About the rewriting systems produced by the Knuth-Bendix completion algorithm
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complete Sets of Reductions for Some Equational Theories
• Unnamed Item
• Unnamed Item