Connect with UNB
Review the collective agreement
NOTE: Course offerings are subject to budgetary approval
Posting Reference: CS 2333 SJ01B
| Course Prefix: | CS | Course Number: | 2333 |
| Course Section: | SJ01B | Course Name: | Computability & Formal Languages (LEC) |
| Term: | Winter | Campus: | Saint John |
| Faculty: | Science, Applied Science and Engineering, Faculty of | Department: | Computer Science and Applied Statistics, Department of |
| Position Start Date: | 2025-01-06 | Position End Date: | 2025-04-25 |
| Posting Date: | 2024-10-21 | Application Deadline: | 2024-10-31 |
| Applications to be submitted via: | dcs@unb.ca | ||
| Requested By: | Dr. Janet Light |
| Days: | Tu/Th | Time: | 9:30AM - 10:50AM |
| Number of Positions Available: | 1 | Total Credit Hours: | 3ch |
| Mode of Delivery: | Face to Face | Location: | On Campus |
| Stipend Amount: | $7193 |
CS2333 Computability and Formal Languages 4 ch (3C 1T)
This course introduces students to some of the fundamental ideas in theoretical computer science: functions and relations, formal languages, finite automata, regular languages, context-free grammars, context-free languages, push-down automata, pumping lemmas, Turing machines, the Church-Turing thesis, recursive and recursively enumerable languages, the Chomsky hierarchy, the halting problem and other unsolvable decision problems, problem reducibility, and fundamental computational complexity classes.
CS2333 Computability and Formal Languages 4 ch (3C 1T)
This course introduces students to some of the fundamental ideas in theoretical computer science: functions and relations, formal languages, finite automata, regular languages, context-free grammars, context-free languages, push-down automata, pumping lemmas, Turing machines, the Church-Turing thesis, recursive and recursively enumerable languages, the Chomsky hierarchy, the halting problem and other unsolvable decision problems, problem reducibility, and fundamental computational complexity classes.
Prerequisite: CS 1073, CS 1303, and 30 ch.
The successful applicant will possess, at minimum, a Masters degree in CS. Requests will be considered on the basis of qualifications, experience required and the availability of the employee to perform the required duties at scheduled times.
*Subject to minimum enrollment of 15