1 / 12

Theoretical Foundations of Computer Science Course

Dive into mathematical preliminaries, automata theory, formal languages, push-down automata, Turing machines, and recursive function theory. Learn to classify, explain, design, and demonstrate the principles of computation.

draper
Download Presentation

Theoretical Foundations of Computer Science Course

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ANJUMAN COLLEGE OF ENGINEERING & TECHNOLOGY Department of Computer Science & Engineering Theoretical Foundations of Computer Sciences Prof.ImteyazShahzad

  2. Syllabus: • Unit 1: Mathematical preliminaries –Sets, operations, relations, strings, closure of relation, countability and diagonalization, induction and proof methods- pigeon-hole principle ,concept of language, formal grammars, Chomsky hierarchy. • Unit 2: Finite Automaton, regular languages, deterministic & non deterministic finite automata, ϵ-closures, minimization of automata, equivalence, Moore and Mealy machine. • Unit 3: Regular expression, identities, Regular grammar, right linear, left linear, Arden theorem, Pumping lemma for regular sets, closure & decision properties for regular sets, Context free languages, parse trees and ambiguity, reduction of CFGS, Normal forms for CFG .

  3. Unit 4:Push down Automata (PDA), non-determinism, acceptance by two methods and their equivalence, conversion of PDA to CFG, CFG to PDAs, closure and decision properties of CFLs, pumping lemma for CFL. • Unit 5:Turing machines, TM as acceptor, TM as transducers, Variations of TM, linear bounded automata, TM as computer of function. • Unit 6:Recursively enumerable (r.e.) set, recursive sets, Decidability and solvability, Post correspondence Problem (PCP), Introduction to recursive function theory, primitive recursive functions, Ackerman function.

  4. COURSE OUTCOMES: • CO1: Classify the concept of languages and automata. • CO2: Explain the formal relationships among machines, languages and grammars. • CO3: Construct Regular Grammar and normal forms for CFG. • CO4: Design and develop finite automata for given regular language. • CO5: Design Push Down Automata, Turing Machine for given languages • CO6: Demonstrate use of computability, decidability, recursive function theory through problem solving

  5. Turing machines

  6. Turingmachine consist of 7 TUPLE: M=(Q, Ʃ,┌ , δ, qo, B, F) Q= Set of Finite State Ʃ= Set of Alphabet ┌ = Finite Set Tap Symbol δ = Transition Function Mapping From Q x┌ toQ x┌ x (L,R) q0= Initial State B= Blank Symbol F= Output Mapping Function

  7. L={anbn│n≥0}

  8. Transition Table

  9. Design a Turing Machine For 2’s Compliment of binary number.

  10. Transition Table

  11. L={WCWr│W=(a,b)*and Wris a reverse of W }

  12. THANK YOU

More Related