Basic Definitions, Relations, Functions, Equivalence Relations And Order Relations, Countable Sets and Cantor's Diagonal Argument, Finite State Automata (deterministic and Non-deterministic), And Non-deterministic), Regular Expressions, Pumping Lemma, Formal Grammars.

Faculty: Computer Science
|Undergraduate Studies

Course with no extra credit

44114 - Discrete Mathematics Ee 94344 - Discrete Mathematics (for I.e) 94345 - Discrete Mathematics (for I.e) 94346 - Discrete Mathematics 104002 - Basic Concepts in Mathematics 104290 - Set Theory 234144 236353 - Automata and Formal Languages

Semestrial Information