Decidability of reachability for disjoint union of term rewriting systems
From MaRDI portal
Publication:1325846
DOI10.1016/0304-3975(94)90267-4zbMath0805.68075OpenAlexW2099310349MaRDI QIDQ1325846
Jean-Luc Coquidé, Anne-Cecile Caron
Publication date: 15 May 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90267-4
Related Items
Linear generalized semi-monadic rewrite systems effectively preserve recognizability ⋮ Congruential complements of ground term rewrite systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular properties of conditional term rewriting systems
- Reductions in tree replacement systems
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Monadic Thue systems
- Modularity of simple termination of term rewriting systems with shared constructors
- Termination for direct sums of left-linear complete term rewriting systems
- Modular aspects of properties of term rewriting systems related to normal forms
- Completeness of combinations of constructor systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- On interreduction of semi-complete term rewriting systems
