Scribd
Upload
144 views

Discrete Structures, Logic and Computability by James L. Hein

Dien Dinh

Uploaded by

Trinh Ngô Lê Phương
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
144 views

Discrete Structures, Logic and Computability by James L. Hein

Dien Dinh

Uploaded by

Trinh Ngô Lê Phương
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 311 Computational Structures

October 2019 Class Syllabus

TEXT: Introduction to Automata Theory, Languages, and Computation


by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman.
REFERENCE: Introduction to the Theory of Computation, by Michael Sipser.
Discrete Structures, Logic and Computability by James L. Hein.

CLASS SCHEDULE: ..

INSTRUCTOR: Assoc. Prof. Dr. Dien Dinh


Computational Linguistics Center, US-VNU-HCM
C44, Building C, 227 Nguyen Van Cu Str., Dist. 5, HCMC, VN.
Email: [email protected]
Course link:
https://www.dropbox.com/sh/2tvcxh34iewhk84/AABWnR2rVF3MS4cg2iVwv6
1wa?dl=0

TEACHING ASSISTANT: Nguyen Hoang Long Email: [email protected]


Faculty of Information Technology, HCMUS
The TAs will help students to do exercises and experiments in the lab.

COURSE DESCRIPTION:
Introduces the foundations of computing: regular languages and finite automata; context-free
languages and pushdown automata; Turing machines and equivalent models of computation;
computability; introduction to complexity.

PREREQUISITES: CS 251 (Logical Structures).

LABORATORY:
The Prolog language is used for programming experiments.

FINAL GRADE DETERMINATION:


Homework & Assignments 25%
Presentation & Slides 25%
Final Exam (written) 50% (closed book, allow 1 double-sided A4-paper note)
Bonus unlimited

Weekly Schedule

Session Description Notes


Week 1 Introduction

Week 2 Finite Automata


- Intro to DFAs
- Formal definition of DFA
- Acceptance in a DFA

Week 3 NFAs Assignment#1


- NFA as 5-tuple
- Running and accepting in an NFA
- Regular operations on NFAs
- Equivalence of NFAs and DFAs
- Preview of the subset construction
- A-closure
Week 4 Regular Expression
- Regular Expressions
- The Algebra of Regular Expressions
- Transforming RE to FA
- Transforming FA to RE

Week 5 Regular Languages Assignment#2


- Regular Grammars
- Pumping Lemma

Week 6 Properties of Regular Languages


- Building NFAs fm grammars Student
- Building grammars fm NFAs presentation#1,2,3

Week 7 Context-Free Languages/Grammar Student


- CF grammar presentation#4,5,6
- Definitions for PDA Assignment#3
- Non-equivalence of DFA and NFA
Week 8 Context-Free Language Topics & PDA Student
- Converting PDA into CFGs presentation#7,8,9
- Converting CFG into PDAs
- Chomsky Normal Form

Week 9 Turing Machines Student


- Definition of a Turing Machine presentation#10,11,12
- Turing Machine with Output
- Alternative Definitions
- A Universal Turing Machine
- Equivalence of Computational Models
- A Simple Programming Language

Week 10 Computability Student


- Effective Enumerations presentation#13,14,15
- The Halting Problem Assignment#4
- The Total Problem
- Other Problems:
A Hierarchy of Languages
- NP-Complete problems
- P = NP?
Final Exam 120 minutes

Presentation:
- Number of group members: 4
- Duration: 30 mins + 10 mins QA
- Written report (slide) is to be submitted on the presentation time

Application: Practical applications of computational structures.

You might also like