Fundamentals of the theory of computation: principles and practice
Fundamentals of the theory of computation: principles and practice
Using theoretical computer simulators for formal languages and automata theory
ACM SIGCSE Bulletin
Algorithms
The Definitive ANTLR Reference: Building Domain-Specific Languages
The Definitive ANTLR Reference: Building Domain-Specific Languages
Teaching concurrency and nondeterminism with spin
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Teaching students to think nondeterministically
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Control Network Programming Illustrated: Solving Problems with Inherent Graph-Like Representation
ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)
Control network programs and their execution
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Control network programming: static search control with system options
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Spider vs. Prolog: computation control
CompSysTech '09 Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Control network programming with SPIDER: dynamic search control
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Non-procedural implementation of local heuristic search in control network programming
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
| Hi-index | 0.00 |
The aim of this series of two reports is to demonstrate that Control Network Programming (CNP), respectively WinSpider, can be used as an excellent environment for teaching and learning both nondeterminism and randomization. More specifically, the focus is on CNP implemented models and algorithms typically studied in courses on Computation theory and Artificial intelligence for students in computing programs. In this first part only teaching the concept of nondeterminism is discussed; the second report to be published elsewhere is devoted to randomized models and algorithms.