The first language we consider is the language of propositional logic. It is based on propositions (or declarative sentences) which can either be true or false. Some examples are: 1. Grass is green. 2. The sky is yellow. 3. Every natural number n > 2 is the sum of two prime numbers. 4. If I do not study then I get an F in this course. Sentence (1) is obviously true, whereas sentences (2) is fal...

This paper presents some of the principles underlying verification and controller synthesis techniques for discrete dynamical systems developed within Computer Science along with some ideas to extend them to continuous and hybrid systems. Hopefully, this will provide control theorists and engineers with an additional perspective of their discipline as seen by a sympathetic outsider, uncommitted...

Computer science or computing science (sometimes abbreviated CS) is the learning of the theoretical foundations of information and computation, and of practical techniques for their execution and application in computer systems. It is often described as the efficient study of algorithmic processes that produce, explain, and transform information. In this work, I use Data Mining algorithms from ...

The National Science Foundation has noted declining enrollments in computing, increasing workforce needs for graduates, and changes in the computing education needed in the future. They thus sponsored four regional workshops which each suggested ways to increase enrollments: multiple entry points to the undergraduate major, better presentation of computing careers, interdisciplinary courses and...