Scribd
Upload
54 views1 page

CSI3104 Course Schedule

The tentative course outline provides an overview of topics to be covered in class from January to April, including chapters, assignments, and exam dates. Key topics include: - Introduction to formal languages, recursive definitions, and regular expressions in January. - Finite automata, transition graphs, Kleene's theorem, and nondeterministic finite automata in January and early February. - Regular languages, nonregular languages, and decidability in mid-February. - Context-free grammars, pushdown automata, and equivalence of context-free grammars and pushdown automata in March. - Non-context-free languages, Turing machines, and recursively enumerable languages late March.

Uploaded by

Justin Lannin-Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views1 page

CSI3104 Course Schedule

The tentative course outline provides an overview of topics to be covered in class from January to April, including chapters, assignments, and exam dates. Key topics include: - Introduction to formal languages, recursive definitions, and regular expressions in January. - Finite automata, transition graphs, Kleene's theorem, and nondeterministic finite automata in January and early February. - Regular languages, nonregular languages, and decidability in mid-February. - Context-free grammars, pushdown automata, and equivalence of context-free grammars and pushdown automata in March. - Non-context-free languages, Turing machines, and recursively enumerable languages late March.

Uploaded by

Justin Lannin-Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TENTATIVE COURSE OUTLINE:

Topic Chapters Date


Chapters 1, 2,
Introduction, Languages, Recursive Definitions Jan 11-14
3
Regular Expressions Chapter 4 Jan 14-18
Finite Automata, Transition Graphs Chapters 5, 6 Jan 18-25
Jan 25-Feb
Kleene's Theorem, Nondeterministic Finite Automata (Assignment 3) Chapter 7
4
Feb 4-Feb
Finite Automata with Output, Regular Languages Chapters 8, 9
8
Chapters
Nonregular Languages (Assignment 4), Decidability Feb 12
10,11
Reading Week Feb 15-18
Feb 22 or
Midterm exam
25
Chapters 12,
Context-Free Grammars, Grammatical Format (Assignment 5) March 1-4
13
Pushdown Automata, Context-Free Grammars = Pushdown Automata Chapters 14, March 8-
(Assignment 6) 15 15
March 15-
Non-Context-Free Languages Chapter 16
18
March 22-
Turing Machines (Assignment 7) Chapter 19
25
March 25-
Recursively Enumerable Languages Chapter 23
29
Context-Free Languages Chapter 17 April 1
Decidability, Parsing Chapter 18 April 5-8

You might also like