Welcome to MTH401A!! Theory of Computation
|
|
- Horace Walker
- 5 years ago
- Views:
Transcription
1 Welcome to MTH401A!! Theory of Computation
2 Contact Information Instructor : Office : 327, Faculty Building Phone : 7880 or akasha@iitk.ac.in Web : Office Hours : After class Any other times : By (preferred) By appointment
3 Question! Can computers solve all computational problems?
4 Question! Can computers solve all computational problems? No!
5 Question! Can computers solve all computational problems? No! One of the primary goals of this course is to formally show that no is indeed the correct answer.
6 Question! Can computers solve all computational problems? No! One of the primary goals of this course is to formally show that no is indeed the correct answer. we need to make sense of the question itself
7 Question! Can computers solve all computational problems? No! One of the primary goals of this course is to formally show that no is indeed the correct answer. we need to make sense of the question itself
8 Computation
9 Computation Problem: Given two numbers, find their sum.
10 Computation Problem: Given two numbers, find their sum. Given numbers a and b add multistep procedure involving symbolic representation, reading, writing, remembering Produce a number c such that c = a + b
11 Computation Problem: Given two numbers, find their sum. Given numbers a and b add multistep procedure involving symbolic representation, reading, writing, remembering Produce a number c such that c = a + b Problem Instance: What is SEVEN plus THREE?
12 Computation Problem: Given two numbers, find their sum. Given numbers a and b add multistep procedure involving symbolic representation, reading, writing, remembering Produce a number c such that c = a + b Problem Instance: What is SEVEN plus THREE? symbol 7 3 symbol
13 Computation Problem: Given two numbers, find their sum. Given numbers a and b add multistep procedure involving symbolic representation, reading, writing, remembering Produce a number c such that c = a + b Problem Instance: What is SEVEN plus THREE?
14 Computation Problem: Given two numbers, find their sum. Given numbers a and b add multistep procedure involving symbolic representation, reading, writing, remembering Produce a number c such that c = a + b Problem Instance: What is SEVEN plus THREE? Computation: =
15 Computation Problem: Given two numbers, find their sum. Problem Instance: What is One million five hundred eighty eight thousand two hundred and seventy eight plus three million two hundred ninety two thousand eight hundred fifty nine?
16 Computation Problem: Given two numbers, find their sum. Problem Instance: What is One million five hundred eighty eight thousand two hundred and seventy eight plus three million two hundred ninety two thousand eight hundred fifty nine?
17 Computation Problem: Given two numbers, find their sum. Problem Instance: What is One million five hundred eighty eight thousand two hundred and seventy eight plus three million two hundred ninety two thousand eight hundred fifty nine? Computation: =
18 Computation Both computations produce unique answer to a given problem.
19 Computation Both computations produce unique answer to a given problem. Computational problem can be viewed as a function: Every valid input has a desired output.
20 Computation Both computations produce same answer to a given problem. Computational problem can be viewed as a function: Every valid input has a desired output. Computation: the process of deriving the desired output from given input(s).
21 Description Languages, Machines, etc.
22 Description Languages, Machines, etc. Computational Problem: Given A and B, compute C, their sum.
23 Description Languages, Machines, etc. Computational Problem: Given A and B, compute C, their sum. Simplified Computational Problem: Given A, B and C, check if C is the sum of A and B.
24 Description Languages, Machines, etc. Computational Problem: Given A and B, compute C, their sum. Simplified Computational Problem: Given A, B and C, check if C is the sum of A and B. Output is YES or NO.
25 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N.
26 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO.
27 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. Solution of this problem is equivalent to checking the membership of the set { p : p is a prime }
28 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. Solution of this problem is equivalent to checking the membership of the set { p : p is a prime } = { 2, 3, 5, 7, 11, 13, }
29 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. members are strings of symbols coming from {0,1, 2, 3, 4, 5, 6, 7, 8, 9} Solution of this problem is equivalent to checking the membership of the set { p : p is a prime } = { 2, 3, 5, 7, 11, 13, }
30 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. Solution of this problem is equivalent to checking the membership of the set { p : p is a prime } = { 2, 3, 5, 7, 11, 13, } = { 10, 11, 101, 111, 1011, 1101, }
31 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. members are strings of symbols coming from {0,1} Solution of this problem is equivalent to checking the membership of the set { p : p is a prime } = { 2, 3, 5, 7, 11, 13, } = { 10, 11, 101, 111, 1011, 1101, }
32 Description Languages, Machines, etc. Computational Problem: Compute all primes p less than N. Language! Simplified Computational Problem: Given p, check if p is a prime. Output is YES or NO. members are strings of symbols coming from {0,1} Solution of this problem is equivalent to checking the membership of the set { p : p is a prime } = { 2, 3, 5, 7, 11, 13, } = { 10, 11, 101, 111, 1011, 1101, }
33 Description Languages, Machines, etc. Formalizing and understanding computing utilizes the idea of languages.
34 Description Languages, Machines, etc. Formalizing and understanding computing utilizes the idea of languages. Two ways of describing a language Machine description. Grammar description.
35 Course Outline
36 Course Outline Regular languages Finite state machines. Non-deterministic finite state machines. Regular expressions. Algorithms to decide about regular languages.
37 Course Outline Context free languages Context free grammars. Pushdown automata. Algorithms for context free grammars.
38 Course Outline Recursive and recursively enumerable languages Turing machines. Decidability of problems. What can be computed? NP-completeness and beyond.
39 Evaluation Policy Quizzes (Short, Unannounced) 20% Mid Semester Exam 30% End Semester Exam 50%
40 Books Elements of the Theory of Computation Christos H. Papadimitriou Introduction to Automata Theory, Languages, and Computation John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
Source of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D.
Source of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman And Introduction to Languages and The by J. C. Martin Basic Mathematical
More informationPlace Value. Unit 1 Lesson 1
Unit 1 Lesson 1 Students will be able to: Read, write, whole numbers and decimals to thousandths. Key Vocabulary: Digits Place value position Decimal point The standard form The expanded form Digits are
More informationIntroduction to the Theory of Computation, Sipser, PWS, ISBN X, 1996
CA320: COMPUTABILITY AND COMPLEXITY 1 1 Introduction CA320 Computability and Complexity Lecturer: Office: L2.55 Phone: 5017 Email: hamilton@computing.dcu.ie WWW: http://www.computing.dcu.ie/ hamilton Course
More informationFormal languages and computation models
Formal languages and computation models Guy Perrier Bibliography John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman - Introduction to Automata Theory, Languages, and Computation - Addison Wesley, 2006.
More informationFormal Languages and Compilers Lecture I: Introduction to Compilers
Formal Languages and Compilers Lecture I: Introduction to Compilers Free University of Bozen-Bolzano Faculty of Computer Science POS Building, Room: 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/
More information17. [Exploring Numbers]
. [Exploring Numbers] Skill. Comparing whole numbers. Compare the size of the digits in the same place, one at a time. Work from left to right across each number. Q. Which number is the A ) 06 B ) 60 C
More informationONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES *
ONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES * Pradip Peter Dey, Mohammad Amin, Bhaskar Raj Sinha and Alireza Farahani National University 3678 Aero Court San Diego, CA 92123 {pdey, mamin,
More information(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar
Code No: R05310501 Set No. 1 III B.Tech I Semester Regular Examinations, November 2008 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE
More informationA Characterization of the Chomsky Hierarchy by String Turing Machines
A Characterization of the Chomsky Hierarchy by String Turing Machines Hans W. Lang University of Applied Sciences, Flensburg, Germany Abstract A string Turing machine is a variant of a Turing machine designed
More informationWhole Numbers WHOLE NUMBERS.
Whole Numbers WHOLE NUMBERS www.mathletics.co.uk How does it wk? Solutions Whole Numbers Page questions Place values Write down the place values f each of these numbers a 6 b 60 Place value of : 000 Place
More informationWelcome to MTH 308 A/B!! Principles of Numerical Computation / Numerical Analysis and Scientific Computing
Welcome to MTH 308 A/B!! Principles of Numerical Computation / Numerical Analysis and Scientific Computing Contact Information Instructor : Office : 327, Faculty Building Phone : 7880 or 0512-259-7880
More informationRegular Languages (14 points) Solution: Problem 1 (6 points) Minimize the following automaton M. Show that the resulting DFA is minimal.
Regular Languages (14 points) Problem 1 (6 points) inimize the following automaton Show that the resulting DFA is minimal. Solution: We apply the State Reduction by Set Partitioning algorithm (särskiljandealgoritmen)
More information1.1 Review of Place Value
1 1.1 Review of Place Value Our decimal number system is based upon powers of ten. In a given whole number, each digit has a place value, and each place value consists of a power of ten. Example 1 Identify
More informationSyllabi of the Comprehensive Examination in Computer Science
Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect
More informationWhole Numbers. Whole Numbers. Solutions. Curriculum Ready.
Whole Numbers Whole Numbers Solutions Curriulum Ready www.mathletis.om Page questions Plae values Write down the plae values for eah of these numbers a 6 b 60 Plae value of : 000 Plae value of : Plae
More informationHow to convert a numeric value into English words in Excel
How to convert a numeric value into English words in Excel (Microsoft Office Excel 2003, Microsoft Office Excel 2007, Microsoft Excel 2010, Excel 2016, Microsoft Excel 2013) Summary This article contains
More informationProblems, Languages, Machines, Computability, Complexity
CS311 Computational Structures Problems, Languages, Machines, Computability, Complexity Lecture 1 Andrew P. Black Andrew Tolmach 1 The Geography Game Could you write a computer program to play the geography
More informationAutomata and Formal Languages - CM0081 Introduction
Automata and Formal Languages - CM0081 Introduction Andrés Sicard-Ramírez Universidad EAFIT Semester 2018-2 Administrative Information Course Coordinator Andrés Sicard Ramírez Head of the Department of
More informationComputability and Complexity Sample Exam Questions
Computability and Complexity Sample Exam Questions Wolfgang Schreiner Wolfgang.Schreiner@risc.jku.at Family Name: Given Name: Matriculation Number: Study Code: Total: 100 Points. 51 Points: GEN4 64 Points:
More informationCS Compiler Construction West Virginia fall semester 2014 August 18, 2014 syllabus 1.0
SYL-410-2014C CS 410 - Compiler Construction West Virginia fall semester 2014 August 18, 2014 syllabus 1.0 Course location: 107 ERB, Evansdale Campus Course times: Tuesdays and Thursdays, 2:00-3:15 Course
More informationT.E. (Computer Engineering) (Semester I) Examination, 2013 THEORY OF COMPUTATION (2008 Course)
*4459255* [4459] 255 Seat No. T.E. (Computer Engineering) (Semester I) Examination, 2013 THEY OF COMPUTATION (2008 Course) Time : 3 Hours Max. Marks : 100 Instructions : 1) Answers to the two Sections
More informationEvaluation Scheme L T P Total Credit Theory Mid Sem Exam
DESIGN OF LANGUAGE PROCESSORS Semester II (Computer Engineering) SUB CODE: MECE201 Teaching Scheme (Credits and Hours): Teaching scheme Total Evaluation Scheme L T P Total Credit Theory Mid Sem Exam CIA
More informationCompiler Construction LECTURE # 1
Compiler Construction AN OVERVIEW LECTURE # 1 The Course Course Code: CS-4141 Course Title: Compiler Construction Instructor: JAWAD AHMAD Email Address: jawadahmad@uoslahore.edu.pk Web Address: http://csandituoslahore.weebly.com/cc.html
More informationTheory of Programming Languages COMP360
Theory of Programming Languages COMP360 Sometimes it is the people no one imagines anything of, who do the things that no one can imagine Alan Turing What can be computed? Before people even built computers,
More informationRatios can be written in several different ways. Using a colon. Using the word to. Or as a fraction.
Show Me: Proportional Relationships M7051 Tanyss and her family are redecorating parts of their house. One of their projects is to replace the tiles on the kitchen floor, and they will use this plan of
More informationTHE DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS
2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. THE DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS Alfred V. Aho Bell
More informationThe Big Picture. Chapter 3
The Big Picture Chapter 3 Examining Computational Problems We want to examine a given computational problem and see how difficult it is. Then we need to compare problems Problems appear different We want
More informationCourse Title: Theory of Computation Course no: CSC-251 Full Marks: Credit hours: 3 Pass Marks: 36+4
Course Title: Theory of Computation Course no: CSC-251 Full Marks: 90+10 Credit hours: 3 Pass Marks: 36+4 Nature of course: Theory (3 Hrs.) Course Synopsis: Deterministic and non-deterministic finite state
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016 Lecture 15 Ana Bove May 23rd 2016 More on Turing machines; Summary of the course. Overview of today s lecture: Recap: PDA, TM Push-down
More informationUsing Scantron ParLAN 6.5 for the First Time:
Page 1 of 19 Using Scantron ParLAN 6.5 for the First Time: Last updated: Monday, December 02, 2013 Nine Basic Steps To request a Scantron Account, please contact the Academic Technology Center. Step One:
More informationCT32 COMPUTER NETWORKS DEC 2015
Q.2 a. Using the principle of mathematical induction, prove that (10 (2n-1) +1) is divisible by 11 for all n N (8) Let P(n): (10 (2n-1) +1) is divisible by 11 For n = 1, the given expression becomes (10
More informationSTATE OF OKLAHOMA COUNCIL ON LAW ENFORCEMENT EDUCATION AND TRAINING
STATE OF OKLAHOMA COUNCIL ON LAW ENFORCEMENT EDUCATION AND TRAINING APPLICATION FOR INTERMEDIATE OR ADVANCED LAW ENFORCEMENT CERTIFICATION Law Enforcement Professional's Certification Program In order
More informationLesson 1: THE DECIMAL SYSTEM
Lesson 1: THE DECIMAL SYSTEM The word DECIMAL comes from a Latin word, which means "ten. The Decimal system uses the following ten digits to write a number: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. Each time
More information1. [5 points each] True or False. If the question is currently open, write O or Open.
University of Nevada, Las Vegas Computer Science 456/656 Spring 2018 Practice for the Final on May 9, 2018 The entire examination is 775 points. The real final will be much shorter. Name: No books, notes,
More informationMATH LEVEL 2 LESSON PLAN 5 DECIMAL FRACTIONS Copyright Vinay Agarwala, Checked: 1/22/18
Section 1: The Decimal Number MATH LEVEL 2 LESSON PLAN 5 DECIMAL FRACTIONS 2018 Copyright Vinay Agarwala, Checked: 1/22/18 1. The word DECIMAL comes from a Latin word, which means "ten. The Decimal system
More informationMidterm Exam II CIS 341: Foundations of Computer Science II Spring 2006, day section Prof. Marvin K. Nakayama
Midterm Exam II CIS 341: Foundations of Computer Science II Spring 2006, day section Prof. Marvin K. Nakayama Print family (or last) name: Print given (or first) name: I have read and understand all of
More informationTheory Bridge Exam Example Questions Version of June 6, 2008
Theory Bridge Exam Example Questions Version of June 6, 2008 This is a collection of sample theory bridge exam questions. This is just to get some idea of the format of the bridge exam and the level of
More informationCisco WebEx Meetings Server Release 1.5MR2. CWMS 1.5MR2 Extended Branding
Cisco WebEx Meetings Server Release 1.5MR2 CWMS 1.5MR2 Extended Branding Table of Contents Before You Begin... 2 Overall user interface... 3 Audio Prompts... 4 Logo... 5 Copyright Statement... 6 Reverting
More informationSCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year
SCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year 2013-2014 SEMESTER - I S. No. Syllabus Ref. No. SUBJECT Scheme of Scheme of Examination
More informationMath 6, Unit 1 Notes: Whole Numbers Estimating, and Patterns
Math 6, Unit 1 Notes: Whole Numbers Estimating, and Patterns Objectives: (1.2) The student will estimate by rounding to a given place value. (1.5) The student will use a variety of methods to estimate.
More informationTheory of Computation
Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s
More informationAnswer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.
Code No: 134BD Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. II Year II Sem., I Mid-Term Examinations, February - 2018 FORMAL LANGUAGES AND AUTOMATA THEORY Objective Exam Name:
More informationJNTUWORLD. Code No: R
Code No: R09220504 R09 SET-1 B.Tech II Year - II Semester Examinations, April-May, 2012 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max. Marks: 75 Answer any five
More informationCompilers for Modern Architectures Course Syllabus, Spring 2015
Compilers for Modern Architectures Course Syllabus, Spring 2015 Instructor: Dr. Rafael Ubal Email: ubal@ece.neu.edu Office: 140 The Fenway, 3rd floor (see detailed directions below) Phone: 617-373-3895
More informationCISC2000/ of 6
CISC2000/2010 1 of 6 Lecture 3 Fall 2018 Prof. Zhang Last week: 1. Three aspects of programming: a) programming language (syntax and semantics) b) problem solving skills (divide and conquer, step-wise
More informationMultiplying and Dividing Fractions 2
Unit : Linear Equations Name Directions: Solve. Multiplying and Dividing Fractions 7 Appendix B: Answer Keys Transparency/Guided Practice Book Answers 4 Unit : Linear Equations Name Directions: Calculate.
More informationNondeterministic Query Algorithms
Journal of Universal Computer Science, vol. 17, no. 6 (2011), 859-873 submitted: 30/7/10, accepted: 17/2/11, appeared: 28/3/11 J.UCS Nondeterministic Query Algorithms Alina Vasilieva (Faculty of Computing,
More informationCS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG
CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG 1 Notice Assignments No new homework this week. Please make up the homework 1 5 & class exercises this week.
More informationClass 4 Decimals. Answer the questions. For more such worksheets visit
ID : in-4-decimals [1] Class 4 Decimals For more such worksheets visit www.edugain.com Answer the questions (1) What is the place value of 4 in 365.704? (2) Write two and five-tenths as a decimal fraction.
More informationQUESTION BANK. Formal Languages and Automata Theory(10CS56)
QUESTION BANK Formal Languages and Automata Theory(10CS56) Chapter 1 1. Define the following terms & explain with examples. i) Grammar ii) Language 2. Mention the difference between DFA, NFA and εnfa.
More informationUniversity of Nevada, Las Vegas Computer Science 456/656 Fall 2016
University of Nevada, Las Vegas Computer Science 456/656 Fall 2016 The entire examination is 925 points. The real final will be much shorter. Name: No books, notes, scratch paper, or calculators. Use pen
More informationSummer 2013 Modules 9-13
Summer 201 Modules 9-1 Mastering the Fundamentals Chris Millett Copyright 201 All rights reserved. Written permission must be secured from the author to use or reproduce any part of this book. Academic
More informationTo illustrate what is intended the following are three write ups by students. Diagonalization
General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers they should be clear
More informationCS 374: Algorithms & Models of Computation
CS 374: Algorithms & Models of Computation Chandra Chekuri Manoj Prabhakaran University of Illinois, Urbana-Champaign Fall 2015 Chandra & Manoj (UIUC) CS374 1 Fall 2015 1 / 37 CS 374: Algorithms & Models
More informationMultiple Choice Questions
Techno India Batanagar Computer Science and Engineering Model Questions Subject Name: Formal Language and Automata Theory Subject Code: CS 402 Multiple Choice Questions 1. The basic limitation of an FSM
More informationCSE 504: Compiler Design
http://xkcd.com/303/ Compiler Design Course Organization CSE 504 1 / 20 CSE 504: Compiler Design http://www.cs.stonybrook.edu/~cse504/ Mon., Wed. 2:30pm 3:50pm Harriman Hall 116 C. R. Ramakrishnan e-mail:
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
Course Code : CS0301 Course Title : Compiler Design Semester : V Course Time : July Dec 2011 DAY SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN SECTION
More informationFinal Course Review. Reading: Chapters 1-9
Final Course Review Reading: Chapters 1-9 1 Objectives Introduce concepts in automata theory and theory of computation Identify different formal language classes and their relationships Design grammars
More informationNumber Bases LESSON TWO. Computer Science. By John Owen
Number Bases LESSON TWO By John Owen Computer Science Objective In the last lesson you learned about different Number Bases used by the computer, which were Base Two binary Base Eight octal Base Sixteen
More informationECS 120 Lesson 16 Turing Machines, Pt. 2
ECS 120 Lesson 16 Turing Machines, Pt. 2 Oliver Kreylos Friday, May 4th, 2001 In the last lesson, we looked at Turing Machines, their differences to finite state machines and pushdown automata, and their
More informationChapter 8 Patterns. Examples: a, b, c,, x, y, z
Chapter 8 Patterns Alegbra is a way of expressing mathematical ideas that use variables, constants, numerical coefficients, and mathematical operations. Variable is a letter that represents an unknown
More informationActually talking about Turing machines this time
Actually talking about Turing machines this time 10/25/17 (Using slides adapted from the book) Administrivia HW due now (Pumping lemma for context-free languages) HW due Friday (Building TMs) Exam 2 out
More informationTheory: 4 Hrs/Week Max. University Theory Examination: 60 Marks Max. Time for Theory Exam.: 3 Hrs. Continuous Internal Assessment: 40 Marks
School: Computer Science & Application Year : Second Year Course: Compiler Design Programme: M.C.A. Semester - IV Course Code: CSA0100P402 Theory: 4 Hrs/Week Max. University Theory Examination: 60 Marks
More informationSpecifying Syntax COMP360
Specifying Syntax COMP360 The most important thing in the programming language is the name. A language will not succeed without a good name. I have recently invented a very good name and now I am looking
More informationComputation, Computers, and Programs. Administrivia. Resources. Course texts: Kozen: Introduction to Computability Hickey: Introduction to OCaml
CS20a: Computation, Computers, Programs Instructor: Jason Hickey Email: jyh@cs.caltech.edu Office hours: TR 10-11am TAs: Nathan Gray (n8gray@cs.caltech.edu) Brian Aydemir (emre@cs.caltech.edu) Jason Frantz
More informationFrom Theorem 8.5, page 223, we have that the intersection of a context-free language with a regular language is context-free. Therefore, the language
CSCI 2400 Models of Computation, Section 3 Solutions to Practice Final Exam Here are solutions to the practice final exam. For some problems some details are missing for brevity. You should write complete
More informationFinal Exam 1, CS154. April 21, 2010
Final Exam 1, CS154 April 21, 2010 Exam rules. The exam is open book and open notes you can use any printed or handwritten material. However, no electronic devices are allowed. Anything with an on-off
More informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : III Year, V Semester Section : CSE - 1 & 2 Subject Code : CS6503 Subject
More informationRecommended Canvas Quiz Settings
Recommended Canvas Quiz Settings 1. Quiz Name: Exams are to include semester, course number, and exam number. Make the exam name and posting name are the same in Canvas and 2. Quiz Type: Graded Quiz 3.
More informationTAFL 1 (ECS-403) Unit- V. 5.1 Turing Machine. 5.2 TM as computer of Integer Function
TAFL 1 (ECS-403) Unit- V 5.1 Turing Machine 5.2 TM as computer of Integer Function 5.2.1 Simulating Turing Machine by Computer 5.2.2 Simulating Computer by Turing Machine 5.3 Universal Turing Machine 5.4
More informationLYCEE EL HOREYA LANGUAGE SCHOOL MATHEMATICS DEPARTMENT WORKSHEETS NAME :... CLASS :...
LYCEE EL HOREYA LANGUAGE SCHOOL MATHEMATICS DEPARTMENT WORKSHEETS NAME :... CLASS :... Any number multiplied by( X) by 1 = the same number Ex. 3 x 1 = 3 7 x 1 = 7 2 - Any number X by 0 = 0 Ex. 4 x 0 =
More informationFinite Automata. Dr. Nadeem Akhtar. Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur
Finite Automata Dr. Nadeem Akhtar Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur PhD Laboratory IRISA-UBS University of South Brittany European University
More informationDEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN. B.Tech-IT, III Year -I Sem
DEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN B.Tech-IT, III Year -I Sem Dr. Smriti Agrawal Assoc. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad
More informationComplexity Theory VU , SS General Information. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 1. General Information Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 06 March, 2018 Reinhard
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0301 Course Title : Compiler Design Semester : V Course Time
More informationComputer Sciences Department
1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER 3 D E C I D A B I L I T Y 4 Objectives 5 Objectives investigate the power of algorithms to solve problems.
More informationTheory of Computations Spring 2016 Practice Final
1 of 6 Theory of Computations Spring 2016 Practice Final 1. True/False questions: For each part, circle either True or False. (23 points: 1 points each) a. A TM can compute anything a desktop PC can, although
More informationQUICK REFERENCE GUIDE
QUICK REFERENCE GUIDE SpeakToText 2.5 Speech Recognition (Version 2.51) Copyright 2002-2006 CoolSoft, LLC All rights reserved. When you first start using SpeakToText, we recommend that you print a copy
More informationMidterm Practice Exam Sample Solutions
Name: SID: CS 620 Theory of Computation Fall 2017 Instructor: Marc Pomplun Midterm Practice Exam Sample Solutions Duration: 1 hour and 15 minutes You only need your writing utensils to complete this exam.
More information50 MATHCOUNTS LECTURES (6) OPERATIONS WITH DECIMALS
BASIC KNOWLEDGE 1. Decimal representation: A decimal is used to represent a portion of whole. It contains three parts: an integer (which indicates the number of wholes), a decimal point (which separates
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTER SCIENCE AND ENGINEERING COURSE PLAN Course Code : CS1014 Semester: VI Course Title : System Software and Compiler Design Course Time:
More informationCollege of San Mateo Course Outline
College of San Mateo Course Outline New Course Update/No change Course Revision (Minor) Course Revision (Major) Date: 1/26/12 Department: CIS Number: 420 Course Title: Project Management Professional Certificate
More informationLLparse and LRparse: Visual and Interactive Tools for Parsing
LLparse and LRparse: Visual and Interactive Tools for Parsing Stephen A. Blythe, Michael C. James, and Susan H. Rodger 1 Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590
More informationThanks, Peanut! Polygons are simple, closed figures having three or more straight sides. Or are they?
Angle Sums MA6927 Activity Introduction In Math news today, we re discussing the interior angle sums of polygons. To lead us into this labyrinth of sides and angles is Daaaaaaaaan Anchormann! Direct Instruction
More informationWhole Numbers. Whole Numbers. Solutions. Curriculum Ready.
Whole Numbers Whole Numbers Solutions Curriulum Ready www.mathletis.om Copyright 009 P Learning. All rights reserved. First edition printed 009 in Australia. A atalogue reord for this book is available
More informationR10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design?
Code No: R22054 COMPUTER ORGANIZATION (Com. to CSE, ECC) 1. a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? 2. Explain Memory Subsystem Organization
More informationDecision Properties for Context-free Languages
Previously: Decision Properties for Context-free Languages CMPU 240 Language Theory and Computation Fall 2018 Context-free languages Pumping Lemma for CFLs Closure properties for CFLs Today: Assignment
More informationCommon Core State Standards Mathematics (Subset K-5 Counting and Cardinality, Operations and Algebraic Thinking, Number and Operations in Base 10)
Kindergarten 1 Common Core State Standards Mathematics (Subset K-5 Counting and Cardinality,, Number and Operations in Base 10) Kindergarten Counting and Cardinality Know number names and the count sequence.
More informationStep 1 The number name given in the question is five and sixty-eight-hundredths. We know that
Answers (1) 5.68 The number name given in the question is five and sixty-eight-hundredths. We know that hundredths can be represented as 1. So, we can write five and sixty-eight-hundredths as 5 and 68
More informationOklahoma State University Institute of Technology Face-to-Face Common Syllabus Fall 2017
Oklahoma State University Institute of Technology Face-to-Face Common Syllabus Fall 2017 ITD 3443 Network Security Students will provide Cyber Defense while understanding Cyber Threats. Their attack types
More informationBooks : 4 th SEMESTER MCA F.M -70. Programming With Java(3-1-0)Cr.-4. Module-1
MCA 206 Module-1 Programming With Java(3-1-0)Cr.-4 F.M -70 Introduction to Java Programming Language, Java Evolution, Naming Conventions and Datatypes, Operators in Java, Control Statements in Java, Decision
More informationTuring Machines. A transducer is a finite state machine (FST) whose output is a string and not just accept or reject.
Turing Machines Transducers: A transducer is a finite state machine (FST) whose output is a string and not just accept or reject. Each transition of an FST is labeled with two symbols, one designating
More informationCS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 9 January 26, 2018 Outline Turing Machines and variants multitape TMs nondeterministic TMs Church-Turing Thesis decidable, RE, co-re languages Deciding and Recognizing
More informationPre-Algebra Notes Unit One: Rational Numbers and Decimal Expansions
Pre-Algebra Notes Unit One: Rational Numbers and Decimal Expansions Rational Numbers Rational numbers are numbers that can be written as a quotient of two integers. Since decimals are special fractions,
More informationIn the following description the h: drive is used to indicate the directory in which during the actual ci101 exam the files used will reside.
Important In the following description the h: drive is used to indicate the directory in which during the actual ci101 exam the files used will reside. However, if you are trying the exam system out yourself
More informationOn the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages
INFORMATION AND CONTROL 52, 2--7 (1982) On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages Louise HAY Department of Mathematics, Statistics, and Computer Science,
More informationCompiler Design. Dr. Chengwei Lei CEECS California State University, Bakersfield
Compiler Design Dr. Chengwei Lei CEECS California State University, Bakersfield The course Instructor: Dr. Chengwei Lei Office: Science III 339 Office Hours: M/T/W 1:00-1:59 PM, or by appointment Phone:
More informationCOURSE SPECIFICATION
COURSE SPECIFICATION Choice based Credit System (CBCS) Scheme and course structure for Information Technology 4 th semester effective from academic session 2016 and onwards Course Code Name of the Subject
More informationLogic and Discrete Mathematics
ICY0001 Logic and Discrete Mathematics Margarita Spit²akova Department of Software Science Tallinn University of Technology 2018/19 Fall semester margarita.spitsakova@ttu.ee Introduction 1 / 14 Next section
More informationMini-Lecture 4.1 Introduction to Decimals
Mini-Lecture 4.1 Introduction to Decimals 1. Identify place value for a decimal number. 2. Write decimals in words.. Write decimals in standard form. 4. Write decimals as fractions. 5. Write a fraction
More information