Exercise 1 for strings and sets

Slides:

Advertisements

Similar presentations

CCCC 8 CCCC CCCC 8 CCCC.

Advertisements

CCCC CCCC CCCC CCCC.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

LING 438/538 Computational Linguistics Sandiway Fong Lecture 7: 9/12.

1 Lecture 22 Myhill-Nerode Theorem –distinguishability –equivalence classes of strings –designing FSA’s –proving a language L is not regular.

LING 438/538 Computational Linguistics Sandiway Fong Lecture 9: 9/21.

Multiplying and Dividing Monomials. Objectives: Understand the concept of a monomial Use properties of exponents to simplify expressions.

Finding Standard Error. Standard error The standard error is the standard deviation of a sampling distribution – we have three types of standard errors:

COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.

Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with exactly one.

1 Module 24 Myhill-Nerode Theorem –distinguishability –equivalence classes of strings –designing FSA’s –proving a language L is not regular.

Using the Quotient of Powers Property

Unit 4 - Polynomials.

Lecture # 1 (Automata Theory)

1 Welcome to ! Theory Of Automata. 2 Text and Reference Material 1.Introduction to Computer Theory, by Daniel I. Cohen, John Wiley and Sons, Inc., 1991,

Module 2 How to design Computer Language Huma Ayub Software Construction Lecture 7 1.

Formal Methods in SE Theory of Automata Qasiar Javaid Assistant Professor Lecture # 06.

1 Language Definitions Lecture # 2. Defining Languages The languages can be defined in different ways, such as Descriptive definition, Recursive definition,

Recap Lecture-2 Kleene Star Closure, Plus operation, recursive definition of languages, INTEGER, EVEN, factorial, PALINDROME, {anbn}, languages of strings.

Lecture # 3 Regular Expressions 1. Introduction In computing, a regular expression provides a concise and flexible means to "match" (specify and recognize)

Comparisons Hold up the ‘+’ card if you think the answer is always positive. Hold up the ‘-’ card if you think the answer is always negative. The ?? Card.

Review of Properties of Exponents. a 0 = 1, a  0 Properties of Exponents Assume throughout your work that no denominator is equal to zero and that m.

Module 2 How to design Computer Language Huma Ayub Software Construction Lecture 8.

L ECTURE 3 Chapter 4 Regular Expressions. I MPORTANT T ERMS Regular Expressions Regular Languages Finite Representations.

KEEP THE SHIPS AFLOT BY USING YOUR KNOWLEDGE OF SEA TERM KNOWLEDGE. Click here to move on.

Инвестиционный паспорт Муниципального образования «Целинский район»

Review of Radicals and Quadratic Equations Lesson 9.1.

(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.

Recursive Definitions & Regular Expressions (RE)

Lecture 02: Theory of Automata:08 Theory of Automata.

CSC312 Automata Theory Lecture # 3 Languages-II. Formal Language A formal language is a set of words—that is, strings of symbols drawn from a common alphabet.

Exponent Law DescriptionAlgebraic representations To multiply powers with the same base, add the exponents n a x n b = n a+b.

Algebra 1 Mini-Lessons 3x2y(6y + 12xy − 9x) 3(6x2y2 + 12x3y3 − 9x3y)

New Vocabulary VocabularyDefinitionUsing symbols reciprocalFor any nonzero number x, the reciprocal is The number 0 has no reciprocal; The reciprocal.

Figure **: Adjusted average student learning score against unit cost Unit Cost (fcfa) Average adjusted student learning score.

© A B C D 78 A1A2A3A4 B1 B2 B3B4 C1C2 C3C4 D1D2D3D4 A5A6A7A8 B5B6B7B8 C5C6C7C8 D5D6D7D8 Questions: Ships Remaining: © 2012.

Warm Up Finish your test If you already finished, begin looking at 9.1 – Review of Radicals You can start your homework after you have read the section.

Lecture 2 Theory of AUTOMATA

The Binomial Theorem (a+b)2 (a+b)(a+b) a2 +2ab + b2

Lecture 02: Theory of Automata:2014 Asif Nawaz Theory of Automata.

Lecture 03: Theory of Automata:2014 Asif Nawaz Theory of Automata.

CHAPTER TWO LANGUAGES By Dr Zalmiyah Zakaria.

照片档案整理一、照片档案的含义二、照片档案的归档范围三、卷内照片的分类、组卷、排序与编号四、填写照片档案说明五、照片档案编目及封面、备考填写六、数码照片整理方法七、照片档案的保管与保护.

공무원연금관리공단 광주지부 공무원대부등 공적연금 연계제도 공무원연금관리공단 광주지부. 공적연금 연계제도 국민연금과 직역연금 ( 공무원 / 사학 / 군인 / 별정우체국 ) 간의 연계가 이루어지지 않고 있 어 공적연금의 사각지대가 발생해 노후생활안정 달성 미흡 연계제도 시행전.

By Dr.Hamed Alrjoub. 1. Introduction to Computer Theory, by Daniel I. Cohen, John Wiley and Sons, Inc., 1991, Second Edition 2. Introduction to Languages.

Жюль Верн ( ). Я мальчиком мечтал, читая Жюля Верна, Что тени вымысла плоть обретут для нас; Что поплывет судно громадней «Грейт Истерна»; Что.

5.3C- Special Patterns for Multiplying Binomials SUM AND DIFFERENCE (a+b)(a-b) = a² - b² (x +2)(x – 2) = x² -4 “O & I” cancel out of FOIL SQUARE OF A BINOMIAL.

Objectives The student will be able to:

Theory of Automata.

Regular Expressions (Examples)

PROGRAMMING LANGUAGES

Algebra substitution.

6.1 Factoring Polynomials

Objectives The student will be able to:

Key to Homework #8 1. For each of the following context-free grammars (a) and (b) below, construct an LL(k) parser with minimum k according to the following.

Recap Lecture-2 Kleene Star Closure, Plus operation, recursive definition of languages, INTEGER, EVEN, factorial, PALINDROME, {anbn}, languages of strings.

Chris Giovanello, LBUSD Math Curriculum Office, 2004

Factoring using the greatest common factor (GCF).

Objectives The student will be able to:

CSC312 Automata Theory Lecture # 5 Chapter # 4 Cont…

- '1:- bs? a ' I.

Mathsercise-C Ready? Substitution Here we go!.

Recap Lecture-2 Kleene Star Closure, Plus operation, recursive definition of languages, INTEGER, EVEN, factorial, PALINDROME, {anbn}, languages of strings.

CSC312 Automata Theory Lecture # 3 Languages-II.

Welcome to ! Theory Of Automata Irum Feroz

Finite Automata Part Three

Presentation transcript:

Exercise 1 for strings and sets 1. What does each of the following expressions give? (a) a5 (b) |aba7b| (c) || (d) xR , where x = abab (e) AB, where A = {a, b, c}, B = {aaaa, bbbb, cccc}. (f) A*BA* ,where A and B are the same sets defined in (e) above. Answer: (a) aaaaa (b) 10 (c ) 0 (d) baba (e) AB = {aaaaa, abbbb, acccc, baaaa, bbbbb, bcccc, caaaa, cbbbb, ccccc} (f) A*BA* = { x | x = {a, b, c}* and x has aaaa, bbbb, or cccc as a substring} 2. For each of the following sets, which of the strings given below in (1) – (7) are its members? (a) {xyxR | x  {a, b, c}*, y  ccc } (b) {xx | x  {a, b, c}* } (c) {x | x  {a, b, c}* and x has more a’s than b’s. }  {aibj | j, i > 0 } (d) ({a, b, c}* - ({aibj | i > j > 0 }  {aibj | 0 < i < j }))  {aibj | j, i > 0 } (1) aaaabbbb (2) aaaa (3) aaaacccaaaa (4) bbbaaaa (5) abcccccba (6) aaaaab (7) abaaba Answer: (a): (3), (5) (b): (2), (7) (c): (6) (Notice that the members should be in {aibj | i > j > 0}) (d): (1) (Notice that the members should be in {aibi | i > 0 })