The following pages link to (Q3696524):
Displaying 12 items.
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Termination of rewriting (Q1098624) (← links)
- Appraising fairness in languages for distributed programming (Q1112589) (← links)
- Fairness in context-free grammars under every choice-strategy (Q1122988) (← links)
- Abstract fairness and semantics (Q1391865) (← links)
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- (Q3779778) (← links)
- Fair termination is decidable for ground systems (Q5055739) (← links)
- Termination of Fair Computations in Term Rewriting (Q5387839) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705922) (← links)