In this course we'll consider models for languages, machines and computation. We'll also consider their properties such as expressive power, closure, decidability and complexity.
In this course we'll consider models for languages, machines and computation. We'll also consider their properties such as expressive power, closure, decidability and complexity.
In this course we'll consider models for languages, machines and computation. We'll also consider their properties such as expressive power, closure, decidability and complexity.
Introduction to the Theory of Computation, 2nd ed.
Michael Sipser, PWS (2004).
An Introduction to Formal Languages and Automata, 4th ed.
Peter Linz, Jones & Barlett (2006).
Overview: Many conceptual venues have merged into what
is called today the theory of computation. It has sprung from and also generated some of the most remarkable conceptual developments of the last century. In this course we'll consider models for languages, machines & computation. Also, their properties such as expressive power, on the one hand, and closure, decidability and complexity on the other.
Outline: • Preliminaries. Languages.
• Finite Automata & Regular languages.
• Pushdown Automata & Context-free languages.
• Turing Machines. Variations.
• Church's Thesis. Approaches to Computation. Notions of Decidability & Complexity.
Objectives: • To provide grounding on the basic models common
to many subject areas of Computing.
• To exhibit the basic ingredients of computation and
their effect in what may be computed with them.
• To exhibit the relation between language
generators and language recognition devices
• have a grasp of the interplay between gain
in expressive power of a language and the loss in control of what is decidable in that language.