View source for BSc: Theoretical Computer Science

= Theoretical Computer Science =

* <span>'''Course name:'''</span> Theoretical Computer Science
* <span>'''Course number:'''</span> BS-

== Course characteristics ==

=== Key concepts of the class ===

* Automata Theory
* Formal Grammars
* Computability

=== What is the purpose of this course? ===

A good software developer ignorant of how the mechanics of a compiler works is not better than a good pilot when it comes to fix the engine and he will definitively not be able to provide more than average solutions to the problems he is employed to solve. Like automotive engineering teach us, races can only be won by the right synergy of a good driving style and mechanics. Most importantly, limits of computation cannot be ignored in the same way we precisely know how accelerations, forces and frictions prevent us from racing at an unlimited speed. This course will investigate the prerequisites to understand compilers functioning. Although the act of compilation appears deceptively simple to most of the modern developers, great minds and results are behind the major achievements that made this possible. All starts with the Epimenides paradox (about 600 BC), which emphasizes a problem of self-reference in logic and brings us to the short time window between WWI and WW2 when, in 1936, Alan Turing proved that a general procedure to identify algorithm termination simply does not exist. Another major milestone has been reached by Noam Chomsky in 1956 with his description of a hierarchy of grammars. In this long historical timeframe we can put most of the bricks with which we build modern compilers. The course will be an historical tour through the lives of some of the greatest minds who ever lived on this planet.

== Prerequisites ==

[https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]: set theory, inductive definitions and proofs, predicate logic, proof techniques (for example by contradiction, diagonalization...), algebraic structures (preferably).


=== Course Objectives Based on Bloom’s Taxonomy ===

=== - What should a student remember at the end of the course? ===

By the end of the course, the students should be able to recognize and define

* Define a formal language
* List different computational models
* Define computational models such as Finite State Automata and Pushdown Automata
* List different types of Formal Grammars
* Define computability and related concepts
* List applications for automata theory and formal grammar

=== - What should a student be able to understand at the end of the course? ===

By the end of the course, the students should be able to describe and explain (with examples)

* Describe the basic mathematical machinery behind automata theory and how can be applied to programming languages compilers
* Explain Strengths and weaknesses of specific computational model
* Explain Finite State Automata and Pushdown Automata
* Abstract systems using the given models

=== - What should a student be able to apply at the end of the course? ===

By the end of the course, the students should be able to apply

* Formally modelling a system
* Reasoning about verification of program properties
* Specifying a system as Finite State Automata, Pushdown Automata or Turing Machine
* Coding in programming languages an emulator of Finite State Automata
* Using proof techniques by diagonalization

=== Course evaluation ===

{|
|+ Course grade breakdown
!
!
!align="center"| '''Proposed points'''
|-
| Labs/seminar classes
| 20
|align="center"| 40
|-
| Interim performance assessment
| 30
|align="center"| 30
|-
| Exams
| 50
|align="center"| 30
|}

If necessary, please indicate freely your course’s features in terms of students’ performance assessment: None

=== Grades range ===

<div id="tab:ModelsCourseGradingRange">

{|
|+ Course grading range
!
!
!align="center"| '''Proposed range'''
|-
| A. Excellent
| 90-100
|align="center"| 80-100
|-
| B. Good
| 75-89
|align="center"| 65-79
|-
| C. Satisfactory
| 60-74
|align="center"| 50-64
|-
| D. Poor
| 0-59
|align="center"| 0-49
|}


</div>
If necessary, please indicate freely your course’s grading features: The semester starts with the default range as proposed in the Table [[#tab:ModelsCourseGradingRange|1]], but it may change slightly (usually reduced) depending on how the semester progresses.

=== Resources and reference material ===

* Handouts supplied by the instructor
* 
* 
*

== Course Sections ==

The main sections of the course and approximate hour distribution between them is as follows:

{|
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Automata Theory
|align="center"| 42
|-
|align="center"| 2
| Formal Grammars
|align="center"| 24
|-
|align="center"| 3
| Computability
|align="center"| 24
|}

=== Section 1 ===

=== Section title: ===

Automata Theory

=== Topics covered in this section: ===

* Languages
* Finite State Automata
* Pushdown Automata
* Nondeterminism
* Turing Machines

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> &amp; '''Yes/No'''<br />
Development of individual parts of software product code &amp; 1<br />
Homework and group projects &amp; 1<br />
Midterm evaluation &amp; 1<br />
Testing (written or computer based) &amp; 1<br />
Reports &amp; 1<br />
Essays &amp; 0<br />
Oral polls &amp; 0<br />
Discussions &amp; 1<br />



</div>
=== Typical questions for ongoing performance evaluation within this section ===

# What is a Finite State Automaton?
# What is a Pushdown Automaton?
# What is a Turing Machine?
# What is a nondeterministic automaton?
# Given a specific language define a corresponding Finite State Automaton
# Given a specific language define a corresponding Pushdown Automaton
# State the difference between Finite State Automata and Pushdown Automata
# Computing the intersection, union, complement of two automata
# What is Pumping Lemma? Example of applications.
# Operations on Automata

=== Typical questions for seminar classes (labs) within this section ===

# Check if a given language is recognized by a specific Finite State Automaton
# Prove with Pumping Lemma that a language is regular
# Check if a given language is recognized by a specific Pushdown Automaton
# Check if a given language is recognized by a specific Turing Machine
# Define a correct automaton given a specific language

=== Test questions for final assessment in this section ===

# Check if a given language is recognized by a specific Finite State Automaton
# Prove with Pumping Lemma that a language is regular.
# Check if a given language is recognized by a specific Pushdown Automaton
# Check if a given language is recognized by a specific Turing Machine
# Define a correct automaton given a specific language

=== Section 2 ===

=== Section title: ===

Formal Grammars

=== Topics covered in this section: ===

* Chomsky Hierarchy
* Regular Expressions
* Relationships with Automata

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> &amp; '''Yes/No'''<br />
Development of individual parts of software product code &amp; 0<br />
Homework and group projects &amp; 0<br />
Midterm evaluation &amp; 1<br />
Testing (written or computer based) &amp; 0<br />
Reports &amp; 1<br />
Essays &amp; 0<br />
Oral polls &amp; 0<br />
Discussions &amp; 1<br />



</div>
=== Typical questions for ongoing performance evaluation within this section ===

# What is Chomsky Hierarchy?
# What is a Regular language?
# What is a Context-free language?
# What is a Context-sensitive language?
# What is a regular expression?

=== Typical questions for seminar classes (labs) within this section ===

# Given a specific Finite State Automaton define a grammar for the corresponding language
# Given a specific Pushdown Automaton define a grammar for the corresponding language
# Given a regular expression design the corresponding Finite state Automaton
# Given a Finite state Automaton define the regular expression for the corresponding language

=== Test questions for final assessment in this section ===

# What is Chomsky Hierarchy?
# What is a Regular language?
# Given a regular expression design the corresponding Finite state Automaton
# Given a specific Pushdown Automaton define a grammar for the corresponding language

=== Section 3 ===

=== Section title: ===

Computability

=== Topics covered in this section: ===

* Undecidability
* Halting Problem
* Rice Theorem

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> &amp; '''Yes/No'''<br />
Development of individual parts of software product code &amp; 0<br />
Homework and group projects &amp; 0<br />
Midterm evaluation &amp; 1<br />
Testing (written or computer based) &amp; 0<br />
Reports &amp; 0<br />
Essays &amp; 0<br />
Oral polls &amp; 0<br />
Discussions &amp; 1<br />



</div>
=== Typical questions for ongoing performance evaluation within this section ===

# What is Halting Problem?
# What is Rice theorem?
# What is an undecidable problem
# What is a Turing Machine?
# What is Goedelization?

=== Typical questions for seminar classes (labs) within this section ===

# Given a specific computational problem showing that it is undecidable (via reduction to a known problem, for example)
# Show a proof via diagonalization of Halting Problem
# Show a proof via diagonalization of Rice Theorem
# Give an example of an undecidable problem
# Show that a Turing Machine with multiple tapes is equivalent to a Turing Machine with a single tape

=== Test questions for final assessment in this section ===

# What is a Turing Machine?
# What is Halting Problem?
# What is Rice theorem?
# Show a proof via diagonalization of Halting Problem
# Show a proof via diagonalization of Rice Theorem
# Show that a Turing Machine with multiple tapes is equivalent to a Turing Machine with a single tape