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

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

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

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

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

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

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

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

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

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

Further discussion of context-free languages

Lecture 11 Further discussion of context-free languages This is the last lecture of the course that is devoted to context-free languages. As for regular languages, however, we will refer to context-free

CS402- Theory of Automata Solved Subjective From Final term Papers. FINALTERM EXAMINATION Spring 2012 CS402- Theory of Automata

Solved Subjective From Final term Papers Feb 14,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Spring 2012 What is the concept of the Union of FA's? Answer:- (Page 32) FA3 be an FA corresponding

RESEARCH METHODS OF COMPUTER SCIENCE

RESEARCH METHODS OF COMPUTER SCIENCE RESEARCH METHODS OF COMPUTER SCIENCE EHTIRAM RAZA KHAN Sr. Lecturer Dept. of Computer Science Jamia Hamdard University New Delhi By HUMA ANWAR Assistant Director IPM

Context-Free Grammars and Languages. Context-Free Grammars and Languages p.1/40

Context-Free Grammars and Languages Context-Free Grammars and Languages p.1/40 Limitations of finite automata There are languages, such as be described (specified) by NFAs or REs that cannot Context-Free

CS502: Compilers & Programming Systems

CS502: Compilers & Programming Systems Context Free Grammars Zhiyuan Li Department of Computer Science Purdue University, USA Course Outline Languages which can be represented by regular expressions are

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

A R "! I,,, r.-ii ' i '!~ii ii! A ow ' I % i o,... V. 4..... JA' i,.. Al V5, 9 MiN, ; Logic and Language Models for Computer Science Logic and Language Models for Computer Science HENRY HAMBURGER George

ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS

ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS Fifth Edition Susan Jacob Timothy S. Hartshorne John Wiley & Sons, Inc. ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS Fifth Edition

Auditing Leadership The Professional and Leadership Skills You Need. Brian D. Kush

Auditing Leadership The Professional and Leadership Skills You Need Brian D. Kush Auditing Leadership Auditing Leadership The Professional and Leadership Skills You Need BRIAN D. KUSH John Wiley & Sons,

Ambiguous grammar - Wikipedia, the free encyclopedia

Ambiguous grammar From Wikipedia, the free encyclopedia In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation,

Context-sensitive languages

Informatics 2A: Lecture 28 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 22 November, 2012 1 / 19 1 Showing a language isn t context-free 2 3 4 2 / 19 Non-context-free languages

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 23rd May 2013 Time: 09:45-11:45

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Fundamentals of Computation Date: Thursday 23rd May 2013 Time: 09:45-11:45 Please answer any THREE Questions from the FOUR Questions provided.

An Interactive Approach to Formal Languages and Automata with JFLAP

An Interactive Approach to Formal Languages and Automata with JFLAP NSF Grant DUE CCLI-EMD 0442513 Susan H. Rodger Duke University rodger@cs.duke.edu SIGCSE 2011 AlgoViz Workshop March 9, 2011 Formal Languages

G52LAC Languages and Computation Lecture 1

G52LAC Languages and Computation Lecture 1 Administrative Details and Introduction Venanzio Capretta and Henrik Nilsson University of Nottingham G52LACLanguages and ComputationLecture 1 p.1/35 Finding

B.Tech. DEGREE EXAMINATION, MAY (Examination at the end of Third Year) COMPUTER SCIENCE & IT. Paper - I : Operating Systems

(DCS / DIT 311) B.Tech. DEGREE EXAMINATION, MAY - 2015 (Examination at the end of Third Year) COMPUTER SCIENCE & IT Paper - I : Operating Systems Time : 3 Hours Maximum Marks : 75 Answer question No.1

What makes a language a language rather than an arbitrary sequence of symbols is its grammar.

Grammars and machines What makes a language a language rather than an arbitrary sequence of symbols is its grammar. A grammar specifies the order in which the symbols of a language may be combined to make

CSCI 1010 Models of Computa3on. Lecture 16 The Chomsky Language Hierarchy

CSCI 1010 Models of Computa3on Lecture 16 The Chomsky Language Hierarchy Overview Defini3ons of phrase structure, context-free and regular languages Proof showing that languages defined by regular grammars

TC - Theory of Computation

Coordinating unit: 270 - FIB - Barcelona School of Informatics Teaching unit: 723 - CS - Department of Computer Science Academic year: Degree: 2017 BACHELOR'S DEGREE IN INFORMATICS ENGINEERING (Syllabus

CMPT-825 Natural Language Processing

CMPT-825 Natural Language Processing Anoop Sarkar http://www.cs.sfu.ca/ anoop 1 Natural Language and Complexity Formal language theory in computer science is a way to quantify computation From regular

3 - Month Study Planner PES-System Patent Bar Review. Patent Education Series TM Copyright INTELLECTUAL PROPERTIES ENTERPRISES, INC

3 - Month Study Planner PES-System Patent Bar Review Patent Education Series TM Copyright 2014-2016 INTELLECTUAL PROPERTIES ENTERPRISES, INC Copyright 2014-2016 by Intellectual Properties Enterprises,

Reinforcement Learning

Reinforcement Learning With Open AI, TensorFlow and Keras Using Python Abhishek Nandy Manisha Biswas Reinforcement Learning Abhishek Nandy Manisha Biswas Kolkata, West Bengal, India North 24 Parganas,

superseries FIFTH EDITION

Prelims-I046435.qxd 3/16/07 2:59 PM Page i Institute of Leadership & Management superseries Influencing Others at Work FIFTH EDITION Published for the Institute of Leadership & Management AMSTERDAM BOSTON

Adaptive Intelligent Tutoring System for Learning Computer Theory

EUROPEAN ACADEMIC RESEARCH Vol. IV, Issue 10/ January 2017 ISSN 2286-4822 www.euacademic.org Impact Factor: 3.4546 (UIF) DRJI Value: 5.9 (B+) Adaptive Intelligent Tutoring System for Learning Computer

Where did these models come from? Menu. Lecture 8: Context-Free Languages. Modeling Human Intellect. Nondeterministic Machine Models

Menu Lecture 8: Context-Free Languages Review Machine Models of Computing Linguistic Model of Computing Challenge Problem Near-Solution - Liuyi (Eric) Zhang Context-Free Grammars cs302: Theory of Computation

IIT JEE PHYSICS. ( : 39 Years) Topic-wise Complete Solutions. Volume II Heat, Electromagnetism and Modern Physics

IIT JEE PHYSICS (1978 2016: 39 Years) Topic-wise Complete Solutions Volume II Heat, Electromagnetism and Modern Physics Jitender Singh Shraddhesh Chaturvedi PsiPhiETC 2016 ii Copyright c 2016 by Authors

Context-Free Grammars and Languages

September 23, 2014 Limitations of finite automata Limitations of finite automata There are languages, such as {0 n 1 n n 0} that cannot be described (specified) by finite automata or regular expressions

The Calculus of Computation

The Calculus of Computation Aaron R. Bradley Zohar Manna The Calculus of Computation Decision Procedures with Applications to Verification With 60 Figures 123 Authors Aaron R. Bradley Zohar Manna Gates

PeopleSoft Services Forecasting 8.8 Reports

PeopleSoft Services Forecasting 8.8 Reports December 2003 PeopleSoft Services Forecasting 8.8 Reports SKU FSCM88SFM-R 1203 Copyright 1992-2003 PeopleSoft, Inc. All rights reserved. All material contained

Excel Formulas & Functions

Microsoft Excel Formulas & Functions 4th Edition Microsoft Excel Formulas & Functions 4th Edition by Ken Bluttman Microsoft Excel Formulas & Functions For Dummies, 4th Edition Published by: John Wiley

G53CMP: Recap of Basic Formal Language Notions

G53CMP: Recap of Basic Formal Language Notions Henrik Nilsson University of Nottingham, UK G53CMP: Recap of Basic Formal Language Notions p.1/52 About These Slides The following slides give a brief recap

UNITEXT - La Matematica per il 3+2

UNITEXT - La Matematica per il 3+2 Volume 101 Editor-in-chief A. Quarteroni Series editors L. Ambrosio P. Biscari C. Ciliberto M. Ledoux W.J. Runggaldier More information about this series at http://www.springer.com/series/5418

Java Design Patterns. A Tour of 23 Gang of Four Design Patterns in Java. Vaskaran Sarcar

Java Design Patterns A Tour of 23 Gang of Four Design Patterns in Java Vaskaran Sarcar Java Design Patterns: A tour of 23 gang of four design patterns in Java Copyright 2016 by Vaskaran Sarcar This work

CSE303 Introduction to the Theory of Computation Spring 2015 Professor Anita Wasilewska cse303/

CSE303 Introduction to the Theory of Computation Spring 2015 Professor Anita Wasilewska http://www.cs.stonybrook.edu/ cse303/ Time: Tuesday, Thursday 4:00-5:20pm, Place : LIBRARY W4550 Professor Anita

Context-Free Grammar (CFG)

Context-Free Grammar (CFG) Dr. Nadeem Akhtar Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur PhD Formal methods in Software engineering IRISA University of

Context Free Grammars and Languages

Chapter Nine Context Free Grammars and Languages 9.1 INTRODUCTION This chapter introduces the Context-Free Grammars (CFG) and the corresponding languages called Context-Free Languages (CFL). The context

National 5 Mathematics Assessment Practice Topic 8: Surds and indices

SCHOLAR Study Guide National 5 Mathematics Assessment Practice Topic 8: Surds and indices Authored by: Margaret Ferguson Heriot-Watt University Edinburgh EH14 4AS, United Kingdom. First published 2014

Classical Mathematical Logic

Classical Mathematical Logic The Semantic Foundations of Logic Richard L. Epstein with contributions by Leslaw W. Szczerba Princeton University Press Princeton and Oxford Contents Preface Acknowledgments

CITS2211 Discrete Structures Lectures for Semester Non-Regular Languages

CITS2211 Discrete Structures Lectures for Semester 2 2017 Non-Regular Languages October 30, 2017 Highlights We have seen that FSMs are surprisingly powerful But we also saw some languages FSMs can not

How to Write a Better Thesis

How to Write a Better Thesis David Evans Paul Gruba Justin Zobel How to Write a Better Thesis 1 3 David Evans University of Melbourne Parkville Victoria Australia Paul Gruba School of Languages and Linguistics

AUTOMATA AND GRAMMARS. (Linguistic machinery)

1 AUTOMATA AND GRAMMARS (Linguistic machinery) 2 3 From the inbox We are looking for enthusiastic and ambitious people to join our Semantics team in Munich! We won the title of the best FinTech startup

The Use of Context-free Grammars in Isolated Word Recognition

Edith Cowan University Research Online ECU Publications Pre. 2011 2007 The Use of Context-free Grammars in Isolated Word Recognition Chaiyaporn Chirathamjaree Edith Cowan University 10.1109/TENCON.2004.1414551

Context-free Grammars

Context-free Grammars Natural & Programming Languages Laureats Visit July 19, 2013 1/22 Example of a Programming Language: Go designed by Google (2012) documentation : specifies the syntax uses a context-free

Quick Grammar Type Recognition: Concepts and Techniques

Quick Grammar Type Recognition: Concepts and Techniques Amin Milani Fard +, Arash Deldari *, and Hossein Deldari + + Department of Computer Engineering, Ferdowsi University, Mashhad, Iran * Department

Language properties and Grammar of Parallel and Series Parallel Languages

arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of

CSCI 311 : Algorithms and Data Structures

CSCI 311 : Algorithms and Data Structures Fall 2017 Department of Computer Science & Engineering Bucknell University I. Instructor Fahmida Hamid Visiting Assistant Professor Office: D313 Phone: 570-577

Economic and Financial Knowledge-Based Processing

Louis F. Pau. Claudio Gianotti Economic and Financial Knowledge-Based Processing With 67 Figures Springer-Verlag Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Research Professor Louis

Edison on Innovation. 102 Lessons in Creativity for Business and Beyond. Alan Axelrod

Edison on Innovation 102 Lessons in Creativity for Business and Beyond Alan Axelrod Edison on Innovation Edison on Innovation 102 Lessons in Creativity for Business and Beyond Alan Axelrod Copyright

DFC Intelligence DFC Intelligence Phone 858-780-9680 9320 Carmel Mountain Rd Fax 858-780-9671 Suite C www.dfcint.com San Diego, CA 92129 MMOG Subscription Business Models: Table of Contents November 2007

Context Free Grammar (CFG) Analysis for simple Kannada sentences

32 Context Free Grammar (CFG) Analysis for simple Kannada sentences B M Sagar Asst Prof, Information Science, RVCE Bangalore, India sagar.bm@gmail.com Abstract When Computational Linguistic is concerns

ISO/IEC TR TECHNICAL REPORT

TECHNICAL REPORT ISO/IEC TR 29163-3 First edition 2009-12-15 Information technology Sharable Content Object Reference Model (SCORM ) 2004 3rd Edition Part 3: Run-Time Environment Version 1.1 Technologies

THE ECONOMICS OF BANKING

THE ECONOMICS OF BANKING THE ECONOMICS OF BANKING KENT MATTHEWS and JOHN THOMPSON Copyright # 2005 John Wiley & Sons Ltd, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ, England Telephone:

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The

Kendriya Vidyalaya Sangathan

Kendriya Vidyalaya Sangathan Intel* Teach Program MEMORANDUM OF UNDERSTANDING This Memorandum of Understanding ("MoU") is made on ^...20. Technology... c"7 between Intel India Private Limited, a company

Deep Thinking. What Mathematics Can Teach Us About the Mind

Deep Thinking What Mathematics Can Teach Us About the Mind This page intentionally left blank Deep Thinking What Mathematics Can Teach Us About the Mind William Byers Concordia University, Canada World

Informatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy

Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference

Welcome to CS 373. Theory of Computation. Spring 2010

Welcome to CS 373 Theory of Computation Spring 2010 Madhusudan Parthasarathy ( Madhu ) madhu@cs.uiuc.edu What is computable? Examples: check if a number n is prime compute the product of two numbers sort

Discrete Structures. Collection edited by: The Duy Bui Content authors: Duy Bui. Online: <http://cnx.org/content/col10768/1.1>

Discrete Structures Collection edited by: The Duy Bui Content authors: Duy Bui Online: This selection and arrangement of content as a collection is copyrighted by

Advances in Fuzzy Systems - Applications and Theory - Vol. 23

Advances in Fuzzy Systems - Applications and Theory - Vol. 23 Fuzzy Logic for Business, Finance, and Management Downloaded from www.worldscientific.com Fuzzy Logic for Business, Finance, and Management

EDUCATIONAL EFFECTIVENESS SURVEY

Komachin MS 5/8/2015 Sample Size: N= 67 EDUCATIONAL EFFECTIVENESS SURVEY Parent edition V3 This report contains the 9 Characteristics view of parent perceptions. EES Parent V3.0 2003-2014 Center for Educational

Guide to Teaching Computer Science

Guide to Teaching Computer Science Orit Hazzan Tami Lapidot Noa Ragonis Guide to Teaching Computer Science An Activity-Based Approach Dr. Orit Hazzan Associate Professor Technion - Israel Institute of

Syntax Analysis Context Free Grammar

Syntax Analysis Context Free Grammar CMPSC 470 Lecture 05 Topics: Overview of Parser Context-Free Grammar (CFG) Eliminate ambiguity in CFG A. Overview of Parser Source Program Lexical Analyzer token get

Context-Free Grammars

Context-Free Grammars Notes on Automata and Theory of Computation Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Context-Free Grammars

THE MODAL BOOK. Introduction

THE MODAL BOOK i Modal Chart: One-Word Modals ii One-Word Modals Meaning (Unit Number, Page Number) Can Ability (Unit 1, Page 1) Permission question (Unit 5, Page 34) Request question (Unit 6, Page 44)

jfast: A Java Finite Automata Simulator

jfast: A Java Finite Automata Simulator Timothy M. White and Thomas P. Way Applied Computing Technology Laboratory Department of Computing Sciences Villanova University Villanova, PA 19085 timothy.m.white@villanova.edu

INFORMATION SYSTEMS CONTROL AND AUDIT

PRACTICE MANUAL Final Course PAPER : 6 INFORMATION SYSTEMS CONTROL AND AUDIT VOLUME-II BOARD OF STUDIES THE INSTITUTE OF CHARTERED ACCOUNTANTS OF INDIA This practice manual has been prepared by the faculty

FINAL COURSE STUDY MATERIAL PAPER 5 ADVANCED MANAGEMENT ACCOUNTING MODULE 3 BOARD OF STUDIES THE INSTITUTE OF CHARTERED ACCOUNTANTS OF INDIA This Study Material has been prepared by the faculty of the

ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS

ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS Fourth Edition Susan Jacob Timothy S. Hartshorne John Wiley & Sons, Inc. ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS ETHICS AND LAW FOR SCHOOL PSYCHOLOGISTS Fourth

Formal Language Theory

Formal Language Theory Gerhard Jäger University of Tübingen Workshop Artificial Grammar Learning and Formal Language Theory Nijmegen, November 23, 2010 Gerhard Jäger (University of Tübingen) Formal Language

MRCOG Part SBAs and MCQs

MRCOG Part 1 550 SBAs and MCQs MRCOG Part 1 550 SBAs and MCQs Katherine Andersen MBBS BSc (Hons) Specialist Trainee in Obstetrics and Gynaecology, Barnet and Chase Farm Hospitals NHS Trust, London, UK

Context Free Grammar

Context Free Grammar CS 585, Fall 2017 Introduction to Natural Language Processing http://people.cs.umass.edu/~brenocon/inlp2017 Brendan O Connor College of Information and Computer Sciences University

CSCI-GA Compiler Construction Lecture 6: Syntax Analysis. Mohamed Zahran (aka Z)

CSCI-GA.2130-001 Compiler Construction Lecture 6: Syntax Analysis Mohamed Zahran (aka Z) mzahran@cs.nyu.edu Context-Free Grammars Precise syntactic specifications of a programming language For some classes,

FORMAL METHODS II: FORMAL LANGUAGES. September 20, 2013 Rolf Pfeifer Rudolf M. Füchslin

FORMAL METHODS II: FORMAL LANGUAGES September 20, 2013 Rolf Pfeifer Rudolf M. Füchslin Grammars and Languages Languages Natural Languages Natural language + High expressiveness + No extra learning - Ambiguity

Outline. Statistical Natural Language Processing. Symbolic NLP Insufficient. Statistical NLP. Statistical Language Models

Outline Statistical Natural Language Processing July 8, 26 CS 486/686 University of Waterloo Introduction to Statistical NLP Statistical Language Models Information Retrieval Evaluation Metrics Other Applications

q 3 Menu cs3102: Theory of Computation Class 7: Context-Free Languages DPDA Recap: DFA/ε + Stack Adding Nondeterminism q 0 a, ε +

cs3102: Theory of Computation Class 7: Context-Free Menu Nondeterministic PDAs Reviewing Machine Models of Computing Linguistic Models of Computing Spring 2010 University of Virginia David Evans DPDA Recap:

THR95. SAP SuccessFactors Career Development Planning Academy COURSE OUTLINE. Course Version: 71 Course Duration: 5 Day(s)

THR95 SAP SuccessFactors Career Development Planning Academy. COURSE OUTLINE Course Version: 71 Course Duration: 5 Day(s) SAP Copyrights and Trademarks 2017 SAP SE or an SAP affiliate company. All rights

Balancing the Common Core Curriculum in Middle School Education

Balancing the Common Core Curriculum in Middle School Education James H. Bunn Balancing the Common Core Curriculum in Middle School Education Composing Archimedes Lever, the Equation, and the Sentence

A context-free grammar (CFG) is a 4-tuple

Syntax analysis Context-free grammars Previously we used context-free grammars for specifying an input language, and for predictive parsing Now we consider this topic systematically, in much greater detail

Ambiguity Detection Algorithm for Context free Grammar

IJCST o l. 4, Is s u e 2, Ap r i l - Ju n e 2013 ISSN : 0976-8491 (Online ISSN : 2229-4333 (Print Ambiguity Detection Algorithm for Context free Grammar 1 Saurabh Kumar Jain, 2 Ajay Kumar 1,2 Dept. of

PRAXIS Interactive Practice Test Order Form

PRAXIS Interactive Practice Test Order Form Payment information must accompany this form when ordering For credit card orders, please call Praxis Order Services at 1-800-537-3161. A 20% discount for institutions

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

Physics 102 Laboratory Manual Spring 2018

Physics 102 Laboratory Manual Spring 2018 Physics Department William and Mary http://physics.wm.edu/ labs/ Laboratory Manual: General Physics 102 Copyright c 2018 The College of William and Mary All rights

Lecture 9: More on Grammars

Lecture 9: More on Grammars Dr Kieran T. Herley Department of Computer Science University College Cork 2016/17 KH (11/10/16) Lecture 9: More on Grammars 2016/17 1 / 1 Expressive Power of CFGs Not every

Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks

Wiles, J., & Elman, J. (1995). Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks. In Proceedings of the Seventeenth Annual Conference of the

MATHEMATICAL THINKING

MATHEMATICAL THINKING How to Develop it in the Classroom Monographs on Lesson Study for Teaching Mathematics and Sciences Series Editors: Kaye Stacey (University of Melbourne, Australia) David Tall (University

Welcome to. About ETS. Official GRE Verbal Reasoning Practice Questions, Volume 1

Welcome to Official GRE Verbal Reasoning Practice Questions, Volume 1 The book you are holding offers 150 real GRE practice questions directly from the maker of the GRE revised General Test. This book