Pages that link to "Item:Q5901565"
From MaRDI portal
The following pages link to Rewriting Techniques and Applications (Q5901565):
Displayed 8 items.
- Termination criteria for tree automata completion (Q730470) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- (Q2980977) (← links)
- (Q4993342) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)