Pages that link to "Item:Q5166638"
From MaRDI portal
The following pages link to New Undecidability Results for Properties of Term Rewrite Systems (Q5166638):
Displaying 8 items.
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Homomorphism theorem and unreachability for \(\omega\) rewriting systems (Q2725956) (← links)
- Undecidable properties on length-two string rewriting systems (Q2873677) (← links)
- About connections between syntactical and computational complexity (Q3974858) (← links)
- Uniqueness of Normal Forms for Shallow Term Rewrite Systems (Q5278216) (← links)