IMPACT ANALYSIS
Based on the attainments for the batch 2017-2021 on Formal Language Automata Theory of the A.Y. 2020-2021 II-II SEM, the course was initiated to stream of CSE-AI & ML. Also, based on the feedback of the students and some teachers, the gap has been identified. So, to fulfill it, we have organized the Guest Lecture for the A.Y. 2021-2022.
The resource person Dr. Rambabu Pemula, Associate Professor, with over 14+ years of Teaching & Research in Dept. of CSE, Raghu Engineering College (Autonomous), Visakhapatnam, Andhra Pradesh.
The content organized based on the inputs provided by the students in a sequence manner.
The speaker has discussed about the main objective of this program is to create awareness on Context-Free Grammar and Turing Machines and their utilization in current research and societal needs. The speaker steered the session with an introduction to the Chomsky’s hierarchy and grammar with comparison. Also gave detailed information about various types of grammars syntax with examples.
Students performed and learned well in the theory and also students completed solving the problems which were given by the faculty members. After attending the session, the students gained knowledge on some key important features. Based on their knowledge and skill, the students were helped led to asymptotic complexity as a way to compare performance of algorithms. Another major advance was that the Turing model led to the notion of an instantaneous description of a computation and a valid computation.
Summary Report
Event Overview
The Department of Computer Science and Engineering organised a Guest lecture on Context-Free Grammar and Turing Machines for II CSE-AIML students on 30-07-2022. The coordinator of the program, Dr. Harikrishna Bommala, introduced the speaker, Dr. Rambabu Pemula, to all the students and handed over the session to the speaker.
Objectives
The main objective of this program is to create awareness on Context-Free Grammar and Turing Machines and their utilization in current research and societal needs.
Key Topics Covered
The speaker steered the session with an introduction to the Chomsky’s hierarchy and grammar with comparison. He also gave detailed information about various types of grammars syntax with examples.
- Chomsky’s Hierarchy: Includes Type 0, Type 1, Type 2, and Type 3. The session discussed various grammars with their specific restrictions and productions.
- Context-Free Grammar (CFG): Defined as a formal grammar used to generate all possible patterns of strings in a given formal language. It consists of a set of production rules ($G$) used to generate the strings of a language.
- Derivations and Parsing: * Left-most derivation: When the sentential form of an input is scanned and replaced from left to right.
- Parse Tree: A hierarchical representation of terminals or non-terminals representing the derivation of the grammar to yield input strings.
- Normal Forms: Discussed the term "context-free," where a non-terminal symbol ($V$) can always be replaced by a string ($w$) regardless of context.
- GNF (Greibach Normal Form): A CFG is in GNF if all production rules satisfy specific conditions, such as a start symbol generating $\epsilon$ or a non-terminal generating a terminal.
- Turing Machines: Described as consisting of an infinitely long tape divided into cells, each containing a 1, a 0, or an empty space. A "head" moves left or right to read the symbols written in the cells.
Conclusion
Through automata, computer scientists are able to understand how machines compute functions and solve problems. More importantly, it helps define what it means for a function to be computable or for a question to be described as decidable.
How to use this text:
- Formatting: I have used bold headers and bullet points to make the report easier to read in Word.
- Equations: I used LaTeX formatting for technical symbols like $G$ (Grammar) and $\epsilon$ (Epsilon) to ensure they look professional.
Event Overview The Department of Computer Science and Engineering organized a guest lecture on Context-Free Grammar and Turing Machines for II CSE-AIML students on 30-07-2022. The program coordinator, Dr. Harikrishna Bommala, introduced the speaker, Dr. Rambabu Pemula, and handed over the session.
Lecture Details
- Title of Guest Lecture: Context-Free Grammar and Turing Machines
- Name of Guest: Dr. Rambabu Pemula, Associate Professor, Department of CSE, Raghu Engineering College (Autonomous), Visakhapatnam, Andhra Pradesh
- Date: 30-07-2022
- Program Coordinator: Dr. Harikrishna Bommala
- Target Audience: II-II CSE-AI & ML and II-II CSE-DS
Objectives and Outcomes
- Objective: To create awareness among students regarding Context-Free Grammar (CFG) and Turing Machines and their utilization in current research and societal needs.
- Outcome: Students are expected to make use of the concepts discussed to improve their knowledge of CFG and Turing Machines when applied to real-time problems.
- Overview/Remarks: The session was planned to provide deep exposure to the course while covering the prescribed university syllabus.
