Murg term rewrite systems
From MaRDI portal
Publication:975468
DOI10.1016/J.IPL.2008.05.021zbMATH Open1191.68367OpenAlexW1965701491MaRDI QIDQ975468FDOQ975468
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidable approximations of term rewriting systems
- Title not available (Why is that?)
- On ground-confluence of term rewriting systems
- Title not available (Why is that?)
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Some undecidability results concerning the property of preserving regularity
- Title not available (Why is that?)
- Rewriting Techniques and Applications
- The reachability and related decision problems for monadic and semi-constructor TRSs
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- Title not available (Why is that?)
- The unification problem for confluent right-ground term rewriting systems.
- Right-linear half-monadic term rewrite systems
- Characterizing confluence by rewrite closure and right ground term rewrite systems
Cited In (1)
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)
