scientific article
From MaRDI portal
Publication:3702507
zbMath0579.68023MaRDI QIDQ3702507
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Varieties (08B99) Word problems (aspects of algebraic structures) (08A50)
Related Items (12)
Bottom-up tree pushdown automata and rewrite systems ⋮ Termination of rewriting ⋮ First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ A Completion Method to Decide Reachability in Rewrite Systems ⋮ Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems ⋮ Complete axiomatizations of some quotient term algebras ⋮ Decidable call-by-need computations in term rewriting ⋮ Unnamed Item ⋮ A fast algorithm for constructing a tree automaton recognizing a congruential tree language ⋮ Decidable call by need computations in term rewriting (extended abstract) ⋮ Decidability and complexity of simultaneous rigid E-unification with one variable and related results ⋮ Derivation trees of ground term rewriting systems.
This page was built for publication:
