Unique Normalization for Shallow TRS
From MaRDI portal
Publication:3636819
DOI10.1007/978-3-642-02348-4_5zbMath1242.68133OpenAlexW1527100187MaRDI QIDQ3636819
Florent Jacquemard, Guillem Godoy
Publication date: 30 June 2009
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_5
Related Items (3)
Uniqueness of Normal Forms for Shallow Term Rewrite Systems ⋮ A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
- Undecidable properties of flat term rewrite systems
- Reachability and confluence are undecidable for flat term rewriting systems
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Decidability for left-linear growing term rewriting systems.
- Ground reducibility is EXPTIME-complete
- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
- On the Normalization and Unique Normalization Properties of Term Rewrite Systems
- Term Rewriting and All That
- A new decidability technique for ground term rewriting systems with applications
- The Confluence Problem for Flat TRSs
- Automated Reasoning
- Computer Science Logic
- Termination of Rewriting with Right-Flat Rules
This page was built for publication: Unique Normalization for Shallow TRS