scientific article
From MaRDI portal
Publication:3742749
zbMath0605.68075MaRDI QIDQ3742749
Patrick Lebègue, Philippe Devienne
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
equivalenceunificationoriented graphshalting problemsubstitutioninfinite treesunfoldingsProlog-like languagesrecursive head-rewriting rule
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of software (68N01)
Related Items (5)
Satisfiability of the smallest binary program ⋮ Simulation of Turing machines by a left-linear rewrite rule ⋮ Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming ⋮ On the existence of nonterminating queries for a restricted class of PROLOG-clauses ⋮ Weighted systems of equations
This page was built for publication:
