Pages that link to "Item:Q2432538"
From MaRDI portal
The following pages link to Reachability problems on regular ground tree rewriting graphs (Q2432538):
Displaying 12 items.
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- On the reachability of a version of graph-rewriting system (Q989484) (← links)
- Automata on finite trees (Q2074209) (← links)
- First-order logic with reachability predicates on infinite systems (Q2908880) (← links)
- The first-order theory of ground tree rewrite graphs (Q2911631) (← links)
- On Probabilistic Parallel Programs with Process Creation and Synchronisation (Q3000662) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- (Q4207590) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
- Ramsey quantifiers over automatic structures: complexity and applications to verification (Q6649458) (← links)