scientific article; zbMATH DE number 17534

zbMATH Open0756.68060MaRDI QIDQ3974858FDOQ3974858

Authors: Jean-Luc Coquidé, Max Dauchet, Sophie Tison 

Publication date: 26 June 1992

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

Recommendations

• New Undecidability Results for Properties of Term Rewrite Systems
• scientific article; zbMATH DE number 176501
• scientific article; zbMATH DE number 4060699
• scientific article; zbMATH DE number 1638661
• scientific article; zbMATH DE number 617134

zbMATH Keywords

recognizabilitytermination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Cited In (3)

• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• A syntactic view of computational adequacy
• On Syntactic versus Computational Views of Approximability

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 Q3974858)