Pages that link to "Item:Q556686"
From MaRDI portal
The following pages link to Reachability analysis over term rewriting systems (Q556686):
Displayed 7 items.
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- A note on partially ordered tree automata (Q975463) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)