Ordinary interactive small-step algorithms, III
From MaRDI portal
Recommendations
- Ordinary interactive small-step algorithms, II
- Ordinary interactive small-step algorithms. I
- Interactive Small-Step Algorithms I: Axiomatization
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- Mathematical Foundations of Computer Science 2005
- Interactive Algorithms 2005 with Added Appendix
- A unified set of single step algorithms. Part 2: Theory
- scientific article; zbMATH DE number 1200178
- On three-step iteration schemes
Cited in
(14)- A behavioural theory for reflective sequential algorithms
- Abstract State Machines 2004. Advances in Theory and Practice
- Concurrent abstract state machines
- scientific article; zbMATH DE number 1951198 (Why is no real title available?)
- Persistent queries in the behavioral theory of algorithms
- Ordinary interactive small-step algorithms, II
- scientific article; zbMATH DE number 1860674 (Why is no real title available?)
- Interactive Small-Step Algorithms I: Axiomatization
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- Exact exploration and hanging algorithms
- Interactive Algorithms 2005 with Added Appendix
- Study of stepwise simulation between ASM
- Ordinary interactive small-step algorithms. I
- Abstract state machines capture parallel algorithms: correction and extension
This page was built for publication: Ordinary interactive small-step algorithms, III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277781)