# THEORY OF COMPUTATION

Save this PDF as:

Size: px
Start display at page:

## Transcription

1

2

3 THEORY OF COMPUTATION

4

5 THEORY OF COMPUTATION For B.E. (IT, CS), MCA, BSC, BCA, MSC and Other Computer Courses By Dr. Poonam Sinha Head (IT/MCA), BUIT, Barkatullah University Bhopal (MP) Sunita Gond Lecturer, (IT/MCA) Deptt. BUIT, Barkatullah University Bhopal (MP) Apurva Saxena Lecturer, (IT/MCA) Deptt. BUIT, Barkatullah University Bhopal (MP) UNIVERSITY SCIENCE PRESS (An Imprint of Laxmi Publications (P) Ltd.) BANGALORE CHENNAI COCHIN GUWAHATI HYDERABAD JALANDHAR KOLKATA LUCKNOW MUMBAI RANCHI NEW DELHI INDIA USA GHANA KENYA

7 Dedicated to All Beloved Readers, Friends and Family Members

8

9 CONTENT ONTENTS Preface Acknowledgements Syllabuses of Various Universities vii viii ix 1. Introduction of Automata Theory Formal Language Mathematics Preliminaries Relations and Functions Graphs Trees Alphabet Strings Principle of Induction Propositional Logic (Zero Order Logic) Predicate Logic (First Order Logic) Automata Automata and Definition Description Finite Automata/Finite State Machine (FSM) Equivalence of DFA and NFA Finite Automata with Null String or NFA with ε Moves to NFA without ε Minimisation of Finite State Machine or My-Hill-Nerode Algorithm FSM with Output Regular Expression Regular Grammar Pumping Lemma for Regular Grammar Formal Language Definition and Description Phase Structured Grammar or Chomsky Classification of Languages/ Chomsky Hierarchy Properties of Families of Languages ( vii )

10 ( viii ) 4. Regular Expression Finite Automata Equivalence of Finite Automata and Regular Expression Equivalence of Two-Way Finite Automata Context Free Grammar Grammar and Context Free Language Derivation Tree (Parse Tree) Unrestricted Grammar Ambiguous Context Free Language Simplification of Context Free Grammars Normal Form of CFG Pushdown Automata Pushdown Automata Nondeterministic Pushdown Automata Pushdown Automata and Context Free Grammar Two-way Pushdown Automaton Parsing Pumping Lemma for CFG Context Free Language Pumping Lemma for CFL (Context Free Language) Turing Machine Introduction Model of Turing Machine Languages Accepted by Turing Machine Universal Turing Machine Determinism in Turing Machine Non-determinism in Turing Machine Types of Turing Machine Introduction Halting Problem of Turing Machine Post Correspondence Problem... 68

11 ( ix ) 9. Computability Introduction to Complexity Theory Introduction to Undecidability Recursively Enumerable Sets Context Sensitive Language Context Sensitive Language Primitive Recursive Functions Linear Bounded Automata Types of Grammar and its Hierarchy Appendix Solved Examples Important University Solved Problems Objective Type Questions Question Papers Index

12

13 PREF REFACE We are highly delighted to place the book title Theory of Computation in the hands of one esteemed readers. This book has been written for B.E. (IT & CS), MCA, BSc, BCA, MSc and other computer programmes students keeping in view the following special points : Conceptual clarity and practical orientation. To learn the basic concept used in the design and analysis of Theory of Computation. Introduces the principles of Theory of Computation. Provides various methods and techniques suitable for a variety of applications. Covers all aspects of automata. Covers abundance of examples and their solutions. We have put our sincere efforts and knowledge to make you understand the subject matter in simplest and easiest way. Valuable suggestions are always welcome. We have considered the syllabus of Barkatullah University, RGPV, Delhi University and Devi Ahilya University and tried to simplify language of other books. Authors ( xi )

14 ACKNO CKNOWLEDGEMENT WLEDGEMENTS We take this opportunity to expresses our gratitude and thanks to the collegues for their valuable technical suggestions and constant encouragement, without which this book would not come into existence. We are grateful to our family members for inspiring us for this project. We deeply express our heartful thanks to the publishers for publishing this book in such a beautiful get-up and well in time. Authors ( xii )

15 SYLLABUSES OF VARIOUS UNIVERSITIES BARKATULLAH UNIVERSITY (Theory of Computation) Unit I Introduction to Theory of Computation and Finite Automata. Mathematical Preliminaries and Notation : Sets, functions and relations, Graphs and Trees, Proof Techniques, Basic concepts, Languages, Grammars, automatas, deterministic finite accepters, Deterministic accepters and Transition Graphs, Languages, Non deterministic finite accepters, definition of a NDFA, Equivalence of DFA and NDFA, Reduction of the Number of states in finite automata. Unit II Grammars and Languages. Regular expression, Regular Grammar, Regular languages, closure properties of Regular languages, Context free grammars, Simplification of Context free grammars and Normal forms, Properties of context free languages. Unit III Pushdown Automata. Non deterministic pushdown automata : Definition of a pushdown automata, The language accepted by a pushdown automata, Pushdown automata and context free languages, Pushdown automata for context free languages, CFG s for PDA, Deterministic Pushdown automata and Deterministic Context free languages, Grammars and Deterministic context free languages. Unit IV Turing Machines. The Standard Turing Machine : Definition of a Turing Machine, Turing Machines as language accepters, and Turing Machines as Transducers. Combining Turing Machines for complicated tasks, Turing thesis, other models of Turing Machines. Unit V Computability. Limits of algorithmic computation, Some Problems that can not be solved by Turing Machines, Computability and Decidability, the Turing Machine Halting Problem, Reducing one Undecidable Problem to another, Undecidable Problems for Recursively Enumerable languages, The post correspondence problem: Indecidable problems for context free languages, Recursive function, Primitives recursive functions, Ackermanris functions, recursive functions, Post Systems : Rewriting systems : Matrix grammars, Markov Algorithms. ( xiii )

16 Theory Of Computation 40% OFF Publisher : Laxmi Publications ISBN : Author : Poonam Sinha Type the URL : Get this ebook

### Comprehensive CLASS - IX

Comprehensive CLASS - IX Comprehensive [For Class - IX] As Per New Continuous and Comprehensive [For Evaluation Class (CCE) - Scheme IX] given by Central Board of Secondary Education (CBSE) By J.B. Dixit

### A PRACTICAL WORKBOOK FOR COMPUTER SCIENCE (C++) CLASS XI

A PRACTICAL WORKBOOK FOR COMPUTER SCIENCE (C++) CLASS XI A PRACTICAL WORKBOOK FOR COMPUTER SCIENCE (C++) CLASS XI (Strictly according to new curriculum prescribed by CBSE) By Pavithra Karthik, B.Tech,

### The CBSE has prescribed the following novels in the curriculum: (a) The Invisible Man (Unabridged)

ENGLISH (ELECTIVE) CLASS XII The CBSE has prescribed the following novels in the curriculum: (a) The Invisible Man (Unabridged) (b) Silas Marner (Unabridged) by H.G. Wells by George Eliot The students

### 1. Mathematical Preliminaries 1

Preface List of Important Symbols and Notations vii xix 1. Mathematical Preliminaries 1 Chapter Objective 1 Introduction 1 1.1 SET Theory 2 1.2 Alphabets 7 1.3 Strings and Languages 7 1.4 Relations 9 1.5

### Introduction to Theory of Automata, Formal Languages, and Computation

Introduction to Theory of Automata, Formal Languages, and Computation Introduction to Theory of Automata, Formal Languages, and Computation Debidas Ghosh Professor and Founder-Head Department of Computer

### Department of Computer Science and Engineering

COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering B.E/B.Tech/M.E/M.Tech : B.E. Regulation: 2013 PG Specialisation : - Sub. Code / Sub. Name : CS6503 / THEORY OF COMPUTATION

### Preface to the Second Edition. Preface to the Third Edition

C O N T E N T S Preface to the First Edition xi To the student........................... xi To the educator.......................... xii The first edition.......................... xiii Feedback to the

### INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION INTERNATIONAL EDITION

INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION INTERNATIONAL EDITION MICHAEL SIPSER Massachusetts Institute of Technology THOMSON COURSE TECHNOLOGY Australia Canada Mexico Singapore Spain United

### Introduction to Languages, Machines and Logic

Introduction to Languages, Machines and Logic Springer-Verlag London Ltd. Alan P. Parkes Introduction to Languages, Machines and Logic Computable Languages, Abstract Machines and Formal Logic Springer

### ACCOUNTANCY. (Including Project Work) Class XI

ACCOUNTANCY (Including Project Work) Class XI ACCOUNTANCY (Including Project Work) CLASS XI Strictly according to new syllabus prescribed by Central Board of Secondary Education (CBSE) and State Boards

### Bachelor of Science in Computer Science and Information Technology Teachers Orientation Program Paush 1-2, Course no: CSC-251 Full Marks: 90+10

Bachelor of Science in Computer Science and Information Technology Teachers Orientation Program Paush 1-2, 2066 Course Title: Theory of Computation Course no: CSC-251 Full Marks: 90+10 Credit hours: 3

### Discrete Structures, Logic, and Computability

Discrete Structures, Logic, and Computability James L. Hein Portland State University Jones and Bartlett Publishers Sudbury, Massachusetts Boston London Singapore Preface xv / Elementary Notions and Notations

### ACCOUNTING FOR MANAGEMENT

ACCOUNTING FOR MANAGEMENT ACCOUNTING FOR MANAGEMENT For B.Com., B.Com. (CA), BBA., BBM., M.Com., M.Com. (CA), MBA, MCA, Courses of all Indian Universities and Commerce, Management Courses of Periyar University.

### CODE COURSE NAME DESCRIPTION SEM

Course:CS402 - Formal Language and Automata Theory PROGRAMME: COMPUTERSCIENCE&ENGINEERING DEGREE:B. TECH COURSE: Formal Language and Automata Theory SEMESTER: 46 CREDITS: 4 COURSECODE: CS402 COURSE TYPE:

### TOTAL QUALITY MANAGEMENT

TOTAL QUALITY MANAGEMENT TOTAL QUALITY MANAGEMENT By Mr. G. Murugesan Asst. Professor Deptt. of Management Studies V.M.K.V. Engineering College Salem Tamil Nadu UNIVERSITY SCIENCE PRESS (An Imprint of

### OPERATIONS RESEARCH THEORY AND APPLICATIONS

OPERATIONS RESEARCH THEORY AND APPLICATIONS By the Same Author Operations Research: Problems and Solutions (3rd Edn) Quantitative Techniques for Managerial Decisions (2nd Edn) Discrete Mathematics (4th

### The Chomsky Hierarchy comprises four types of languages and their associated grammars and machines. Language Grammar Machine Example

Grammars. Numeric functions (Chapter 4, Sections 4.6, 4.7) CmSc 365 Theory of Computation 1. Grammars Grammars are language generators. They consist of an alphabet of terminal symbols, alphabet of non-terminal

### DIGITAL NOTES ON FORMAL LANGUAGES AND AUTOMATA THEORY B.TECH II YEAR - II SEM ( )

DIGITAL NOTES ON FORMAL LANGUAGES AND AUTOMATA THEORY B.TECH II YEAR - II SEM (2017-18) DEPARTMENT OF INFORMATION TECHNOLOGY MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY (Autonomous Institution UGC,

### THEORY OF FORMAL LANGUAGES WITH APPLICATIONS

Theory of Formal Languages with Applications Downloaded from www.worldscientific.com THEORY OF FORMAL LANGUAGES WITH APPLICATIONS Theory of Formal Languages with Applications Downloaded from www.worldscientific.com

### Machines and languages theory. Lecture 1

Machines and languages theory Lecture 1 Machines and languages theory Instructor: Fatemeh Daneshfar E-mail: f.daneshfar@uok.ac.ir TA:? Text: An Introduction to Formal Languages and Automata, (5th ed.)

### Decision, Computation and Language

Decision, Computation and Language Context-free Grammar (CFG) Dr. Muhammad S Khan (mskhan@liv.ac.uk) Ashton Building, Room G22 http://www.csc.liv.ac.uk/~khan/comp218 The Chomsky Hierarchy Languages exist

### Automata Theory, Languages, and Computation

INTRODUCTION TO Automata Theory, Languages, and Computation 3 r d Edition J O H N E. H O P C R O F T Cornell University RAJEEV MOTWANI Stanford University JEFFREY D. U L L M A N Stanford University PEARSON

### SYLLABUS. PREREQUISITES/COREQUISITES: Pr. grade of at least C in CSC 350 or consent of instructor.

COURSE NUMBER: CSC 553 SYLLABUS COURSE TITLE: Theory of Computation CREDITS: 3:3:0 PREREQUISITES/COREQUISITES: Pr. grade of at least C in CSC 350 or consent of instructor. FOR WHOM PLANNED: This course

### Computer Science 456/656 Spring 2018 Practice Examination March 21, 2018

Computer Science 456/656 Spring 2018 Practice Examination March 21, 2018 The entire examination is 690 points. 1. True or False. [5 points each] T = true, F = false, and O = open, meaning that the answer

### H halting problem, 179. homomorphism, 154

215 A accept, 23, 28, 120, 132, 160 acceptance by empty stack, 127 acceptance by final states, 128 accepting state, 23 algorithm, 178, 179 alphabet, 4 ambiguous, 99 automaton, 1 B Backus normal form, 84

### FORMAL LANGUAGES & AUTOMATA THEORY

B.Tech II Year II Semester () Regular Examinations May/June 2015 FMAL LANGUAGES & AUTOMATA THEY (Computer Science and Engineering) (a) What is a string? How to concatenate two strings? (b) What is context

### Fall CSCI 2670Introduction to Theory of Computing

CSCI 2670 Introduction to Theory of Computing Instructor and Lecture Times Instructor: Don Potter (potter@uga.edu) Office: Boyd GSRC 111; Office Hours: TBA Lecture Times and Locations 9:05-9:55 Mon Life

### Formal Methöds II Sömmary

Formal Methöds II Sömmary Chapter 2: Formal Languages Natural Language (english) + High expressiveness + No extra learning Ambiguity Vagueness Longish style Consistency hard to check Formal Language (c++)

### QUANTITATIVE TECHNIQUES IN MANAGEMENT

QUANTITATIVE TECHNIQUES IN MANAGEMENT Books by the Same Author Operations Research: Theory and Applications (5 th Ed) Operations Research: Problems and Solutions (3 rd Ed) Linear Programming: Theory and

### San José State University Department of Computer Science CS154, Formal Languages and Computability, Sections 1 and 2. Fall Semester, 2015

San José State University Department of Computer Science CS154, Formal Languages and Computability, Sections 1 and 2 Course and Contact Information Fall Semester, 2015 Instructor: Office Location: Thomas

### Philadelphia University Faculty of Information Technology Department of Computer Science ( )

Philadelphia University Faculty of Information Technology Department of Computer Science (2015-2016) Course Syllabus Course Title: Theory of Computation Course Level: 3 Lecture Time: Course code: 750223

### DECIDABILITY AND UNDECIDABILITY

CISC462, Fall 2017, Decidability and undecidability 1 DECIDABILITY AND UNDECIDABILITY Decidable problems from language theory For simple machine models, such as finite automata or pushdown automata, many

### BABA BANDA SINGH BAHADUR ENGINEERING COLLEGE FATEHGARH SAHIB (Department of CSE & IT) ONLINE QUESTION BANK

BABA BANDA SINGH BAHADUR ENGINEERING COLLEGE FATEHGARH SAHIB (Department of CSE & IT) ONLINE QUESTION BANK Branch: CSE Semester: 8 th Subject: FLAT Sub. Code: CS-404 SECTION A 1. State the difference between

### dddd Theory of Computation Dept. of Electrical Engineering National Taiwan University

dddd Theory of Computation ddd Dept. of Electrical Engineering National Taiwan University Class Information Instructor: ddd E-mail: yen@cc.ee.ntu.edu.tw Web: http://www.ee.ntu.edu.tw/ yen Time: 9:10-12:10,

### University of Nevada, Las Vegas Computer Science 456/656 Fall 2005 Review for Final Exam

University of Nevada, Las Vegas Computer Science 456/656 Fall 2005 Review for Final Exam This version Sat Dec 10 03:14:46 PST 2005 Disclaimer: This practice final is much longer than the actual exam will

### Developing Learner-Centered Teaching

Developing Learner-Centered Teaching Developing Learner-Centered Teaching A Practical Guide for Faculty Phyllis Blumberg Foreword by Maryellen Weimer Copyright 2009 by John Wiley & Sons, Inc. All rights

### The Excel. Analyst s. Guide to. Access. Michael Alexander

The Excel Analyst s Guide to Access Michael Alexander The Excel Analyst s Guide to Access The Excel Analyst s Guide to Access Michael Alexander Wiley Publishing, Inc. The Excel Analyst s Guide to Access

### Course 2 Introduction to Automata Theory (cont d)

Course 2 Introduction to Automata Theory (cont d) The structure and the content of the lecture is based on http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm 1 Excursion: Previous lecture 2 Languages

### THEORY OF COMPUTATION IT T55 III YEAR

PART A UNIT - I 1. What is meant by finite automata? 2. What is a formal language? 3. What are the two ways of representing an automaton? 4. What is a formal language? 5. What are the two main types of

### INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Course Title Course Code Programme emester Course Type Regulation INTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, yderabad -500 043 Computer cience and Engineering COURE INFORMATION EET TEORY

### DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY

DURGAPUR INSTITUTE OF ADVANCED TECHNOLOGY AND MANAGEMENT DEPARTMENT OF INFORMATION TECHNOLOGY Subject Code: CS 402 Subject Name: Formal Language & Automata Theory Semester : IV Year: 2 ND Session : 2019

### Venus International College of Technology

Venus International College of Technology Department of Computer Engineering Semester: 6 Sub: Theory of COmputation(160704) Question Bank MODULE-I Ch-Review Of Mathematical Terms And Theory 1. Answer the

### B.C.A THEORY OF COMPUTATION MODULE SPECIFICATION SHEET. PES DEGREE COLLEGE BANGALORE SOUTH CAMPUS Affiliated to Bangalore University

B.C.A 2017-18 THEORY OF COMPUTATION MODULE SPECIFICATION SHEET Course Outline To introduce students the basic concepts in theoretical computer science, and the formal relationships among machines, languages

### رمز النموذج : QF-AQAC-03.02B. The University of Jordan. Accreditation & Quality Assurance Center. COURSE Syllabus

الصفحات: 7/1 The University of Jordan Accreditation & Quality Assurance Center COURSE Syllabus الصفحات: 7/2 1. Course title Theory of Computation 2. Course number 1901241 3. Credit hours (theory, practical)

### PRINCIPLES OF SEQUENCING AND SCHEDULING

PRINCIPLES OF SEQUENCING AND SCHEDULING Kenneth R. Baker Tuck School of Business Dartmouth College Hanover, New Hampshire Dan Trietsch College of Engineering American University of Armenia Yerevan, Armenia

Regular language From Wikipedia, the free encyclopedia "Rational language" redirects here. For the market logic concept, see Market logic. In theoretical computer science, a regular language is a formal

### SYLLABUS. PREREQUISITES/COREQUISITES: Pr. grade of at least C in CSC 350 or consent of instructor.

COURSE NUMBER: CSC 553 SYLLABUS COURSE TITLE: Theory of Computation CREDITS: 3:3:0 PREREQUISITES/COREQUISITES: Pr. grade of at least C in CSC 350 or consent of instructor. FOR WHOM PLANNED: This course

### Formal Languages and Automata Theory Prof. Diganta Goswami Department of Computer Science and Engineering Indian Institute of Technology, Guwahati

Formal Languages and Automata Theory Prof. Diganta Goswami Department of Computer Science and Engineering Indian Institute of Technology, Guwahati Module - 1 Languages and Finite Representation Lecture

### Given these languages, what string w would you select if you wanted to apply the pumping lemma to prove the language is not regular:

Given these languages, what string w would you select if you wanted to apply the pumping lemma to prove the language is not regular: L 1 = { a n b m : n 2 m n 3 } L 2 = {a n b m c p : n=p, and m is odd

### Context Free Grammars

Context Free Grammars UNIT III By Prof.T.H.Gurav Smt.Kashibai Navale COE, Pune Context-Free Grammar Definition. A context-free grammar is a 4-tuple : G = (V, T, P, S) OR G = (V, Σ, P, S) V = Non-terminal(variables)

### UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08008 INFORMATICS 2A: PROCESSING FORMAL AND NATURAL LANGUAGES

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08008 INFORMATICS 2A: PROCESSING FORMAL AND NATURAL LANGUAGES Monday 9 th December 2013 09:30 to 11:30 INSTRUCTIONS

### AN INTRODUCTION TO SAGE PROGRAMMING

AN INTRODUCTION TO SAGE PROGRAMMING AN INTRODUCTION TO SAGE PROGRAMMING With Applications to SAGE Interacts for Numerical Methods RAZVAN A. MEZEI Lenoir-Rhyne University Donald & Helen Schort School of

### CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN. Chapter 2: Context Free Grammar

CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN Chapter 2: Context Free Grammar Quick Note 2 Cs314pnu.wordpress.com 3 2.1 Context Free Grammar (CFG) Useful in App s that use recursion feature

### HEALTH CARE PROFESSIONALS

SECOND EDITION STATISTICS FOR HEALTH CARE PROFESSIONALS WORKING WITH EXCEL JAMES E. VENEY JOHN F. KROS DAVID A. ROSENTHAL STATISTICS FOR HEALTH CARE PROFESSIONALS STATISTICS FOR HEALTH CARE PROFESSIONALS

### Preface. Susan Rodger

Preface When I first started teaching automata theory in 1989, I taught it the traditional way as it had been taught to me. Students programmed finite automaton, pushdown automaton and Turing machines

### DEMO MATH WITH MATHEW

BOOK 0-2 4 DEMO MATH WITH MATHEW 6 5 Worksheets Kindergarten Math 7 10 5 8 9 M This page intentionally left blank Math with Mathew www.worksheet-ebook.com Copyright 2018 by www.worksheet-ebook.com No part

### ENGLISH GRAMMAR WITHOUT TEARS

ENGLISH GRAMMAR WITHOUT TEARS ENGLISH GRAMMAR WITHOUT TEARS By VISHWANATHAN NAIR M.A. (English) Diploma in Journalism Cochin, Kerala CHANDRIKA A M.A. (English), M.Ed., P.G. Diploma in Journalism English

### CSCI Automata, Formal Languages, and Computability

CSCI 4325-01 Automata, Formal Languages, and Computability Course Information Instructor: Dr. Tim Wylie Contact: Office: ENGR 3.287 Office Hours: Phone: 956-665-2577 Email: timothy.wylie@utrgv.edu TR 3:00

### Assessing the Online Learner

Assessing the Online Learner JOSSEY-BASS GUIDES TO ONLINE TEACHING AND LEARNING Resources and Strategies for Faculty Rena M. PALLOFF Keith PRATT Assessing the Online Learner JOSSEY-BASS GUIDES TO ONLINE

### Course 1 Introduction to Automata Theory

Course 1 Introduction to Automata Theory The structure and the content of the lecture is based on http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm 1 What is Automata Theory? Study of abstract

### HACCP. A food industry briefing. Sara E. Mortimore Carol A. Wallace

HACCP HACCP A food industry briefing Sara E. Mortimore Carol A. Wallace SECOND Edition This edition first published 2015 by John Wiley & Sons, Ltd 2015 by Sara E. Mortimore and Carol A. Wallace Registered

### Computational Linguistics II: Parsing

Computational Linguistics II: Parsing Formal Languages: Regular Languages II Frank Richter & Jan-Philipp Söhn fr@sfs.uni-tuebingen.de, jp.soehn@uni-tuebingen.de Computational Linguistics II: Parsing p.1

### Lecture 6: Context-Free Grammars

Lecture 6: Context-Free Grammars September 27, 2016 CS 1010 Theory of Computation So far, we ve classified languages as regular or not regular. Regular languages are recognized by DFAs, NFAs, and regexes,

### CMPS130 F2011: Final Exam

CMPS130 F2011: Final Exam Robert Levinson Date: Monday, December 5, 2011 4-7pm All problems are 10 points unless otherwise marked. There are 328 points possible. 1. Construct a DFA over the alphabet 0,1

### Scientific Theory in Informatics A1N

Scientific Theory in Informatics A1N Lecture 05 Automata Theory and Computability Theory Prof. David Vernon School of Informatics University of Skövde david.vernon@his.se Scientific Theory in Informatics

### Context-Free Grammars

Context-Free Grammars 2017/09/12 Chapter 2.1 in Sipser Ø Announcement: q Slides for this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/cfg.pdf 1 Last time Nonregular languages

### HANDBOOK OF PSYCHOLOGICAL ASSESSMENT

HANDBOOK OF PSYCHOLOGICAL ASSESSMENT HANDBOOK OF PSYCHOLOGICAL ASSESSMENT Fifth Edition Gary Groth-Marnat John Wiley & Sons, Inc. This book is printed on acid-free paper. Copyright 2009 by John Wiley

### Introduction To Automata Theory Languages And Computation Solution Manual

Introduction To Automata Theory Languages And Computation Solution Manual INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND COMPUTATION SOLUTION MANUAL PDF - Are you looking for introduction to automata theory

### THE SHAPING OF. American Higher Education EMERGENCE AND GROWTH OF THE CONTEMPORARY SYSTEM SECOND EDITION

ARTHUR M. COHEN CARRIE B. KISKER THE SHAPING OF American Higher Education EMERGENCE AND GROWTH OF THE CONTEMPORARY SYSTEM SECOND EDITION The Shaping of A merican Higher Education The Shaping of American

### CC503: Software Project Management (4 Credits, 3L + 2T)

CC503: Software Project Management (4 Credits, 3L + 2T) Objectives: To provide basic project management skills with a strong emphasis on issues and problems associated with delivering successful IT projects

### Joomla! Start to Finish. How to Plan, Execute, and Maintain Your Web Site. Jen Kramer. Join the p2p.wrox.com

Join the discussion @ p2p.wrox.com Wrox Programmer to Programmer Joomla! Start to Finish How to Plan, Execute, and Maintain Your Web Site Jen Kramer Programmer to Programmer Get more out of wrox.com Interact

### Automata Theory and Computation Techniques

Automata Theory and Computation Techniques Faculty: POOJA AGARWAL No. Of Hours: 52 Sessions QUESTION BANK INTRODUCTION TO THEORY OF COMPUTATION AND FINITE AUTOMATA OBJECTIVE: This chapter introduces automata

### Managerial Economics

Managerial Economics Managerial Economics EIGHTH EDITION D N DWIVEDI, Ph.D Professor of Economics Maharaja Agrasen Institute of Management Studies, Delhi Former Reader, Ramjas College University of Delhi

### CS 4110 Concepts of Formal Languages and Algorithms for Computing Syllabus

General Information Semester: Fall 2017 Textbooks: When: Required: Introduction to Computer Theory; 2 nd Edition, Cohen, Daniel I.A. Cohen; ISBN- 13 978-0-471-13772-6 Tuesdays and Thursdays, 5:30pm to

### REFLECTION IN THE CHOMSKY HIERARCHY

Journal of Automata, Languages and Combinatorics 18 (2013) 1, 53 60 c Otto-von-Guericke-Universität Magdeburg REFLECTION IN THE CHOMSKY HIERARCHY Henk Barendregt Institute of Computing and Information

### Course Syllabus. Course Information. CS Automata Theory Fall 2013 TR 7-8:15PM. ECSS Semester Hours

Course Syllabus Course Information CS 4384.501 Automata Theory Fall 2013 TR 7-8:15PM. ECSS 2.312 3 Semester Hours Also listed as CS 5349.501 Automata Theory Professor Contact Information Instructor: Richard

### CS 341: Foundations of Computer Science II Fall 2014, Face-to-Face Section

CS 341: Foundations of Computer Science II Fall 2014, Face-to-Face Section Course Info Class Times: Wednesday, Friday, 1:00 2:25 Instructor: Prof. Marvin K. Nakayama Office: GITC 4312 Phone: 973-596-3398

### think smarter ffirs.indd 1 2/21/2014 9:28:10 AM

think smarter think smarter Critical Thinking to Improve Problem-Solving and Decision-Making Skills Michael Kallet Cover image: tumpikuja/istockphoto Cover design: Michael J. Freeland Copyright 2014 by

Tree Adjoining Grammars Tree-Adjoining Grammars Department of Computer Science University of Helsinki Department of Computer Science, University of Helsinki Page 1 Tree Adjoining Grammars Outline Introduction:

### Inf2A: Turing Machines and Linear Bounded Automata. Lecture 26 Stuart Anderson

Inf2A: Turing Machines and Linear Bounded Automata Lecture 26 Stuart Anderson Turing Machines Read/write head each tape cell contains a symbol from a finite alphabet Tape: unbounded in both directions

### SIX SIGMA FOR EVERYONE GEORGE ECKES John Wiley & Sons, Inc.

SIX SIGMA FOR EVERYONE GEORGE ECKES John Wiley & Sons, Inc. Praise for George Eckes and Six Sigma for Everyone Long noted for his ability to simplify complex subjects and effectively move leaders and

### GRE. Quick Prep Edition

GRE Quick Prep Edition GRE Quick Prep Edition by Ron Woldoff, MBA, MIS Founder, National Test Prep with Joe Kraynak GRE For Dummies, Quick Prep Edition Published by John Wiley & Sons, Inc. 111 River Street

### Business Statistics. Fourth Edition. J. K. Sharma VIKAS PUBLISHING HOUSE PVT LTD. Professor Amity Business School, Amity University, Noida

Business Statistics Fourth Edition J. K. Sharma Professor Amity Business School, Amity University, Noida VIKAS PUBLISHING HOUSE PVT LTD VIKAS PUBLISHING HOUSE PVT LTD E-28, Sector-8, Noida-201301 (UP)

### AN INTRODUCTION TO CRITICAL THINKING AND CREATIVITY

AN INTRODUCTION TO CRITICAL THINKING AND CREATIVITY AN INTRODUCTION TO CRITICAL THINKING AND CREATIVITY Think More, Think Better Joe Y. F. Lau WILEY A JOHN WILEY & SONS, INC., PUBLICATION Copyright 2011

### Theory of Languages and Automata

Theory of Languages and Automata Chapter 1- Regular Languages & Finite State Automaton Sharif University of Technology Finite State Automaton O We begin with the simplest model of Computation, called finite

### Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory

### Inf2A: Review of FSMs and Regular Languages

Review of Inf2A: Review of FSMs and Regular Languages Stuart Anderson School of Informatics University of Edinburgh October 6, 2009 Outline Review of Review of and Regular Grammars 2 Looping Behaviour

### Context Sensitive Grammars

Context Sensitive Grammars Rajaguru K CSA, IISc Automata Seminar, Dec,2016 Rajaguru K (CSA, IISc) Context Sensitive Grammars Automata Seminar, Dec,2016 1 / 17 Overview 1 Introduction 2 Formal definition

### Formal Languages and Automata CS314

Formal Languages and Automata CS314 CS Program 3 rd Year (1 st Semester) Page 5-1 Assiut University Faculty of Computers & Information Computer Science Department Quality Assurance Unit Formal Languages

### with three choices for execution, a fast mode that gives the answer, a step mode that steps through an animation, and a multiple input mode to test se

Increasing Visualization and Interaction in the Automata Theory Course Ted Hung and Susan H. Rodger Computer Science Department Duke University Durham, NC 27708-0129 rodger@cs.duke.edu Abstract In this

### PROFORMA KURSUS PUSAT PENGAJIAN SAINS KOMPUTER FAKULTI TEKNOLOGI DAN SAINS MAKLUMAT UNIVERSITI KEBANGSAAN MALAYSIA

PROFORMA KURSUS PUSAT PENGAJIAN SAINS KOMPUTER FAKULTI TEKNOLOGI DAN SAINS MAKLUMAT UNIVERSITI KEBANGSAAN MALAYSIA Pusat Pengajian Sains Komputer School of Computer Science TTTK3353 SEMESTER I SESI 203/204

### What is Chomsky Hierarchy?

Chomsky Hierarchy What is Chomsky Hierarchy? The classification of languages into 4 classes; the description of the grammar for each class, and the machine that can recognize the grammar / language. 2

### UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08008 INFORMATICS 2A: PROCESSING FORMAL AND NATURAL LANGUAGES

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08008 INFORMATICS 2A: PROCESSING FORMAL AND NATURAL LANGUAGES Wednesday 12 th August 2015 09:30 to 11:30 INSTRUCTIONS