HamroCSIT Logo
HAMRO CSIT


Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT
Subject

Theory of Computation

This course presents a study of Finite State Machines and their languages. It covers the details of finite state automata, regular expressions, context free grammars. More, the course includes design of the Push-down automata and Turing Machines. The course also includes basics of undecidability and intractability.

Subject Image | Hamro CSIT
Basic Foundations

1.1. Review of Set Theory, Logic, Functions, Proofs 1.2. Automata, Computability and Complexity: Complexity Theory, Computability Theory, Automata Theory 1.3. Basic concept. . .

1.1. Review of Set Theory, Logic, Functions, Proofs 1.2. Automata, Computability and Complexity: Complexity Theory, Computability Theory, Automata Theory 1.3. Basic concepts of Automata Theory: Alphabets, Power of Alphabet, Kleen Closure Alphabet, Positive Closure of Alphabet, Strings, Empty String, Substring of a string, Concatenation of strings, Languages, Empty Language

47244+ Students

Questions : 5+

Read Note
Introduction to Finite Automata

2.1 Introduction to Finite Automata, Introduction of Finite State Machine 2.2 Deterministic Finite Automata (DFA), Notations for DFA, Language of DFA, Extended Transition Fu. . .

2.1 Introduction to Finite Automata, Introduction of Finite State Machine 2.2 Deterministic Finite Automata (DFA), Notations for DFA, Language of DFA, Extended Transition Function of DFA Non-Deterministic Finite Automaton (NFA), Notations for NFA, Language of NFA, Extended Transition 2.3 Equivalence of DFA and NFA, Subset-Construction 2.4 Method for reduction of NFA to DFA, Theorems for equivalence of Language accepted by DFA and NFA 2.5 Finite Automaton with Epsilon Transition (ε - NFA), Notations for ε - NFA, Epsilon Closure of a State, Extended Transition Function of ε – NFA, Removing Epsilon Transition using the concept of Epsilon Closure, Equivalence of NFA and ε –NFA, Equivalence of DFA and ε – NFA 2.6 Finite State Machines with output: Moore machine and Mealy Machines

60228+ Students

Questions : 23+

Read Note
Regular Expression

3.1 Regular Expressions, Regular Operators, Regular Languages and their applications, Algebraic Rules for Regular Expressions 3.2 Equivalence of Regular Expression and Finit. . .

3.1 Regular Expressions, Regular Operators, Regular Languages and their applications, Algebraic Rules for Regular Expressions 3.2 Equivalence of Regular Expression and Finite Automata, Reduction of Regular Expression to ε – NFA, Conversion of DFA to Regular Expression 3.3 Properties of Regular Languages, Pumping Lemma, Application of Pumping Lemma, Closure Properties of Regular Languages over (Union, Intersection, Complement) Minimization of Finite State Machines: Table Filling Algorithm

40709+ Students

Questions : 15+

Read Note
Context Free Grammar

4.1 Introduction to Context Free Grammar (CFG), Components of CFG, Use of CFG, Context Free Language (CFL) 4.2 Types of derivations: Bottomup and Topdown approach, Leftmost . . .

4.1 Introduction to Context Free Grammar (CFG), Components of CFG, Use of CFG, Context Free Language (CFL) 4.2 Types of derivations: Bottomup and Topdown approach, Leftmost and Rightmost, Language of a grammar 4.3 Parse tree and its construction, Ambiguous grammar, Use of parse tree to show ambiguity in grammar 4.4 Regular Grammars: Right Linear and Left Linear, Equivalence of regular grammar and finite automata 4.5 Simplification of CFG: Removal of Useless symbols, Nullable Symbols, and Unit Productions, Chomsky Normal Form (CNF), Greibach Normal Form (GNF), Backus-Naur Form (BNF) 4.6 Context Sensitive Grammar, Chomsky Hierarchy Pumping Lemma for CFL, Application of Pumping Lemma, Closure Properties of CFL

38417+ Students

Questions : 17+

Read Note
Push Down Automata

5.1 Introduction to Push Down Automata (PDA), Representation of PDA, Operations of PDA, Move of a PDA, Instantaneous Description for PDA 5.2 Deterministic PDA, Non Determini. . .

5.1 Introduction to Push Down Automata (PDA), Representation of PDA, Operations of PDA, Move of a PDA, Instantaneous Description for PDA 5.2 Deterministic PDA, Non Deterministic PDA, Acceptance of strings by PDA, Language of PDA 5.3 Construction of PDA by Final State , Construction of PDA by Empty Stack, 5.4 Conversion of PDA by Final State to PDA accepting by Empty Stack and vice-versa, Conversion of CFG to PDA, Conversion of PDA to CFG

30740+ Students

Questions : 10+

Read Note
Turing Machine

6.1 Introduction to Turing Machines (TM), Notations of Turing Machine, Language of a Turing Machine, Instantaneous Description for Turing Machine, Acceptance of a string by a. . .

6.1 Introduction to Turing Machines (TM), Notations of Turing Machine, Language of a Turing Machine, Instantaneous Description for Turing Machine, Acceptance of a string by a Turing Machines 6.2 Turing Machine as a Language Recognizer, Turing Machine as a Computing Function, Turing Machine with Storage in its State, Turing Machine as a enumerator of stings of a language, Turing Machine as Subroutine 6.3 Turing Machine with Multiple Tracks, Turing Machine with Multiple Tapes, Equivalence of Multitape-TM and Multitrack-TM, Non-Deterministic Turing Machines, Restricted Turing Machines: With Semi-infinite Tape, Multistack Machines, Counter Machines 6.4 Curch Turing Thesis, Universal Turing Machine, Turing Machine and Computers, Encoding of Turing Machine, Enumerating Binary Strings, Codes of Turing Machine, Universal Turing Machine for encoding of Turing Machine

32731+ Students

Questions : 14+

Read Note
Undecidability and Intractability

7.1 Computational Complexity, Time and Space complexity of A Turing Machine, Intractability 7.2 Complexity Classes, Problem and its types: Absract, Decision, Optimization 7. . .

7.1 Computational Complexity, Time and Space complexity of A Turing Machine, Intractability 7.2 Complexity Classes, Problem and its types: Absract, Decision, Optimization 7.3 Reducibility, Turing Reducible, Circuit Satisfiability, Cook’s Theorem, 7.4 Undecidability, Undecidable Problems: Post’s Correspondence Problem, Halting Problem and its proof, Undecidable Problem about Turing Machines

25305+ Students

Questions : 11+

Read Note
7th sem exam offer
HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology