scientific article; zbMATH DE number 19765

zbMATH Open0735.68047MaRDI QIDQ3979263FDOQ3979263

Authors: Jean-Luc Coquidé, Rémi Gilleron 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4043235
• A Completion Method to Decide Reachability in Rewrite Systems
• Termination proofs for ground rewrite systems -- interpretations and derivational complexity
• Reachability in conditional term rewriting systems
• scientific article; zbMATH DE number 176501

zbMATH Keywords

tree automatatree languagesreachability problemsderivation proofs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (9)

• Decidable call-by-need computations in term rewriting
• Derivation trees of ground term rewriting systems.
• Title not available (Why is that?)
• Basic rewriting via logic programming, with an application to the reachability problem
• Decidable call by need computations in term rewriting (extended abstract)
• Reachability problems on regular ground tree rewriting graphs
• Verification of well-formed communicating recursive state machines
• Title not available (Why is that?)
• Senescent ground tree rewrite systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979263)