scientific article
From MaRDI portal
Publication:2848691
zbMath1272.68367MaRDI QIDQ2848691
Publication date: 26 September 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106000090
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods ⋮ Multi-completion with termination tools ⋮ Extending Maximal Completion (Invited Talk)
Uses Software
This page was built for publication:
