This document is an attendance register for the course "CS3005-Theory of Automata (BCS-5J)" held at FAST School of Computing, National University of Computer & Emerging Sciences in Lahore, Pakistan during the Fall 2023 semester. It lists the dates and topics covered during the first two weeks of the course, including finite automata for various languages and regular expressions. The instructor, Ejaz Tahir, and Head of Department, Kashif Zafar, signatures are at the bottom to verify the accuracy of the attendance record.
This document is an attendance register for the course "CS3005-Theory of Automata (BCS-5J)" held at FAST School of Computing, National University of Computer & Emerging Sciences in Lahore, Pakistan during the Fall 2023 semester. It lists the dates and topics covered during the first two weeks of the course, including finite automata for various languages and regular expressions. The instructor, Ejaz Tahir, and Head of Department, Kashif Zafar, signatures are at the bottom to verify the accuracy of the attendance record.
This document is an attendance register for the course "CS3005-Theory of Automata (BCS-5J)" held at FAST School of Computing, National University of Computer & Emerging Sciences in Lahore, Pakistan during the Fall 2023 semester. It lists the dates and topics covered during the first two weeks of the course, including finite automata for various languages and regular expressions. The instructor, Ejaz Tahir, and Head of Department, Kashif Zafar, signatures are at the bottom to verify the accuracy of the attendance record.
National Computing Education Accreditation Council NCEAC
Course Log -Fall 2023
Institution : FAST School of Computing ,National University of Computer & Emerging Sciences, Lahore
Course Name : CS3005-Theory of Automata (BCS-5J)
Week Date Duration Lecture Topics
22-Aug-23 1.5 Language Translation; Lexical Analysis; Parser; Languages as Sets (Finite, Infinite); Union, Intersection, Complement, Difference of Languages; Concatenation and Kleen Star; FA for accepting Languages; FA to accept language of words that starts with an 1 24-Aug-23 1.5 FA to accept language of words that starts with an a or has length divisible by 2; FA for the Even-Even Language; FA for a language s.t. n_a is a multiple of 3 and n_b is a multiple of 4; FA for a language s.t. n_a is a multiple of 3 and n_b mod 4 = 2. 29-Aug-23 1.5 FAs for Languages of words: starting with "aa"; ending with "aa"; containing "aa" as a substring; starting and ending with "aa"; representing numbers that are multiple of 3 (alphabet is {0,1} in this case) 2 31-Aug-23 1.5 FA for the Language of words starting and ending with "aba"; FA for the Language of words ending with b and not containing the substring "aa"; FA for the Language of words containing the substring "abbaab" (concept of matching/finding the longest s