Murg term rewrite systems

DOI10.1016/J.IPL.2008.05.021MaRDI QIDQ975468zbMATHOpenAlexFDO

Authors Sándor Vágvölgyi

Publication date 9 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.05.021

zbMATH Keywords

formal languagestheory of computationterm rewrite systemssets of descendants

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modular term rewriting systems and the termination
• scientific article; zbMATH DE number 1889386
• Extended term rewriting systems
• Term Rewriting and Applications
• scientific article; zbMATH DE number 4090779
• scientific article; zbMATH DE number 1368955
• scientific article; zbMATH DE number 1118018
• Term rewriting systems in logic programming and in functional programming
• Modular termination of prefix-constrained term rewrite systems
• Reversible term rewriting

Cites work

• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 165818 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 794243 (Why is no real title available?)
• scientific article; zbMATH DE number 1405630 (Why is no real title available?)
• Characterizing confluence by rewrite closure and right ground term rewrite systems
• Decidable approximations of term rewriting systems
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• On ground-confluence of term rewriting systems
• Rewriting Techniques and Applications
• Right-linear half-monadic term rewrite systems
• Some undecidability results concerning the property of preserving regularity
• The reachability and related decision problems for monadic and semi-constructor TRSs
• The unification problem for confluent right-ground term rewriting systems.

Cited in

(1)

• Symbol different term rewrite systems

This page was built for publication: Murg term rewrite systems

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