Pages that link to "Item:Q515687"
From MaRDI portal
The following pages link to Reachability, confluence, and termination analysis with state-compatible automata (Q515687):
Displaying 10 items.
- A new technique for reachability of states in concatenation automata (Q777990) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS (Q2960118) (← links)
- (Q3159773) (← links)
- (Q4782023) (← links)
- (Q5089023) (← links)
- Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (Q5164173) (← links)
- Reachability Analysis with State-Compatible Automata (Q5404926) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)