Pages that link to "Item:Q1257333"
From MaRDI portal
The following pages link to Algebraic and graph theoretic characterizations of structured flowchart schemes (Q1257333):
Displaying 8 items.
- Weak equivalence in a class of structured program schemes (Q797988) (← links)
- An axiomatization of D-scheme strong equivalence (Q799095) (← links)
- Continuation semantics for flowgraph equations (Q1080651) (← links)
- Graph theoretic characterization of G-schemes and T L-schemes (Q1159978) (← links)
- A semantically meaningful characterization of reducible flowchart schemes (Q1254851) (← links)
- Axiomatizing schemes and their behaviors (Q1819574) (← links)
- A generalized mathematical theory of structured programming (Q2265794) (← links)
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice (Q4279248) (← links)