CSI 3104 Introduction to Formal Languages

3 units
Computer Science
Faculty of Engineering
Regular languages, finite automata, transition graphs Kleene's theorem. Finite automata with output. Context-free languages, derivation trees, normal form grammars, pumping lemma, pushdown automata, determinism. Decidability. Recursively enumerable languages, Turing machines, the halting problem.

Components:

Lecture

Requirements:

Prerequisite: CSI 2101 or MAT 1348 .

Previously Offered Terms:

Winter
Summer

French Equivalent:

CSI 3504
GradesEvaluations
All Professors
B+ Average (6.971)
Most Common: A+ (23%)
1026 students

P

S

NS

F

D

C

B

A-

A+

Omar Badreldin

Summer 2024 - Z00

A Average (8.817)
Most Common: A+ (54%)
153 students

P

S

NS

F

D

C

B

A-

A+

Thomas Tran

4 sections from Summer 2017 to Winter 2024

B Average (6.480)
Most Common: A+ (16%)
294 students

P

S

NS

F

D

C

B

A-

A+

Amir Eaman

2 sections from Winter 2022 to Summer 2023

B+ Average (6.992)
Most Common: A+ (17%)
259 students

P

S

NS

F

D

C

B

A-

A+

Abdorrahim Bahrami

Winter 2023 - A00

B Average (6.122)
Most Common: A+ (24%)
82 students

P

S

NS

F

D

C

B

A-

A+

Dorra Riahi

Summer 2022 - Z00

B+ Average (7.268)
Most Common: A+ (27%)
112 students

P

S

NS

F

D

C

B

A-

A+

Amy Felty

Winter 2019 - A00

B Average (6.314)
Most Common: B (20%)
70 students

P

S

NS

F

D

C

B

A-

A+

Nejib Zaguia

Winter 2018 - A00

B Average (5.875)
Most Common: B (23%)
56 students

P

S

NS

F

D

C

B

A-

A+