[vc_row el_class=”inner-body-content” css=”.vc_custom_1668505289871{padding-top: 30px !important;padding-bottom: 20px !important;}”][vc_column][vc_custom_heading text=”COURSE OBJECTIVES” use_theme_fonts=”yes” css=”.vc_custom_1668505430054{margin-top: 0px !important;}”][vc_column_text]
- To familiarize the students with the concept of formal languages, different classes of formal languages such as regular languages, context-free languages, context-sensitive languages, recursive and recursively enumerable languages.
- To familiarize students with the grammars and machines used for describing various types of languages. These include regular expressions, finite state automata, context-free grammars, push-down automata and Turing machines.
- To familiarize students with properties of different types of languages.
[/vc_column_text][vc_custom_heading text=”COURSE LEARNING OUTCOMES (CLO)” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]CLO: 1. Describe the role of abstract computational models to define which computational problems are solvable and which are not (C2-Comprehension).
CLO: 2. Define formal languages and their description in the form of formal grammars (C3-Application).
CLO: 3. Design grammars and models for different languages (C5- Synthesis).
[/vc_column_text][vc_custom_heading text=”COURSE CONTENTS” use_theme_fonts=”yes”][vc_column_text css=”.vc_custom_1668505241187{margin-bottom: 0px !important;}”]
- Introduction to Formal Languages
- Regular expressions and finite automata
- Non-deterministic automata
- Transition graphs and Kleene’s Theorem
- Operations on languages
- Closure properties of regular languages
- Pumping lemma
- Mealy and Moore Machines
- Push-down automata
- Context-free grammars
- Parse trees, ambiguity and non-determinism
- Chomsky Normal Form
- Pumping Lemma for Context Free Languages
- Turing machines and Turing computability
[/vc_column_text][/vc_column][/vc_row]