Murg term rewrite systems
From MaRDI portal
Publication:975468
DOI10.1016/J.IPL.2008.05.021zbMath1191.68367OpenAlexW1965701491MaRDI QIDQ975468
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
Cites Work
- 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
- On ground-confluence of term rewriting systems
- 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
- 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
- Decidable approximations of term rewriting systems
- Rewriting Techniques and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Murg term rewrite systems