Search results
Results: 371
Number of items: 371
-
Bergstra, J. A., & Middelburg, C. A. (2012). On the expressiveness of single-pass instruction sequences. Theory of Computing Systems, 50(2), 313-328. https://doi.org/10.1007/s00224-010-9301-8 -
Bergstra, J. A., & Middelburg, C. A. (2012). Process algebra with conditionals in the presence of epsilon. ArXiv. http://arxiv.org/abs/1204.3249
-
Bergstra, J. A., & Middelburg, C. A. (2012). Instruction sequence processing operators. Acta Informatica, 49(3), 139-172. https://doi.org/10.1007/s00236-012-0154-2
-
-
Bergstra, J. A. (2012). Informaticology: combining Computer Science, Data Science, and Fiction Science. ArXiv. http://arxiv.org/abs/1210.6636
-
Bergstra, J. A., & Bethke, I. (2012). On the contribution of backward jumps to instruction sequence expressiveness. Theory of Computing Systems, 50(4), 706-720. https://doi.org/10.1007/s00224-011-9376-x
-
Bergstra, J. A., & Middelburg, C. A. (2012). Indirect jumps improve instruction sequence performance. Scientific Annals of Computer Science, 22(2), 253-265. https://doi.org/10.7561/SACS.2012.2.253
-
Bergstra, J. A., & Middelburg, C. A. (2012). On the behaviours produced by instruction sequences under execution. Fundamenta Informaticae, 120(2), 111-144. https://doi.org/10.3233/FI-2012-753
-
-
Bergstra, J. A., & Ponse, A. (2011). Proposition algebra. ACM Transactions on Computational Logic, 12(3), 21. https://doi.org/10.1145/1929954.1929958
Page 12 of 38