scientific article; zbMATH DE number 1508936

MaRDI QIDQ4506400zbMATH OpenFDO

Authors Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing

Publication date 18 September 2000

Full work available at URL http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/1999/A99-11/A99-11.html

zbMATH Keywords

semantic matching problemterm-rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 67820
• scientific article; zbMATH DE number 1962804
• Term Rewriting and Applications
• scientific article; zbMATH DE number 3988695
• Match-bounded string rewriting systems
• Mathematical Foundations of Computer Science 2003
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• A compact fixpoint semantics for term rewriting systems
• scientific article; zbMATH DE number 6792369
• Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs

Cited in

(3)

• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
• scientific article; zbMATH DE number 1114050 (Why is no real title available?)
• scientific article; zbMATH DE number 937376 (Why is no real title available?)

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