0 visualizações

Enviado por abc

This presentation describes the introduction to the theory of automata.

- weebly whole group math
- AWK Primer
- 171782511 Elain Rich Automa Computiability and Complexity
- FSA
- 231_BLUECOAT-SGOS_CMG_5.1.4_10.pdf
- 2. RE Theorems
- Exercise Questions on Regular Language and Regular Expression
- Ages aptitude questions
- 13 a 05404062017
- Basic ProxyS super practic
- ch9
- Ptyhon Strings.odt
- MIT6_096IAP11_lec04
- Turing - Early Personal Life Education
- 07Python6.pdf
- Salesforce Useful Validation Formulas
- TOC Question Paper
- Regular Pumping
- Comparison of TeX Editors - Wikipedia, The Free Encyclopedia
- NEW LOGIC

Você está na página 1de 52

Lecture – 2

Regular Expression

Recursive definition of Regular Expression(RE)

regular expression.

• Step 2: If r1 and r2 are regular expressions then

• (r1)

• r1 r2 or r2 r1

• r1 + r2 or r2 + r1

• r1* or r2*

are also regular expressions.

• Step 3: Nothing else is a regular expression.

Example

• Now consider another language L, consisting of all

possible strings, defined over Σ = {a, b}. This language

can also be expressed by the regular expression

(a + b)*

exactly double a, having any number of b’s defined

over Σ = {a, b}, then it’s regular expression may be

b*aab*

Example

• Now consider another language L, of even length,

defined over Σ = {a, b}, then it’s regular expression

may be

((a+b)(a+b))*

defined over Σ = {a, b}, then it’s regular expression

may be

•

(a+b)((a+b)(a+b))* or

((a+b)(a+b))*(a+b)

Remark

more than one regular expressions, while given a

regular expression there exist a unique language

generated by that regular expression.

Example

• Consider the language, defined over Σ={a, b} of words

having at least one a, may be expressed by a regular

expression

(a+b)*a(a+b)*

having at least one a and one b, may be expressed by

a regular expression

(a+b)*a(a+b)*b(a+b)* + (a+b)*b(a+b)*a(a+b)*

Example

• Consider the language, defined over Σ={a, b}, of

words starting with double a and ending in double b

then its regular expression may be

aa(a+b)*bb

words starting with a and ending in b OR starting

with b and ending in a, then its regular expression

may be

a(a+b)*b+b(a+b)*a

Practice – Regular Expression ?

• Consider the language, defined over Σ={a, b} of words beginning

with a

Practice – Regular Expression ?

and ending in same letter

a

An important Example

The Language EVEN-EVEN :

• Language of strings, defined over Σ={a, b} having even

number of a’s and even number of b’s. i.e.

EVEN-EVEN = {Λ, aa, bb, aaaa,aabb,abab, abba, baab,

baba, bbaa, bbbb,…},

( aa + bb + (ab+ba)(aa+bb)*(ab+ba) )*

Note

following regular expressions

• r1=a*+b*

• r2=(a+b)*

of a and b, while r2 generates such strings.

Equivalent Regular Expressions

• Definition: Two regular expressions are said to be

equivalent if they generate the same language.

• Example: Consider the following regular expressions

• r1= (a + b)* (aa + bb)

• r2= (a + b)*aa + ( a + b)*bb then

both regular expressions define the language of

strings ending in aa or bb.

Note

• If r1 =(aa + bb) and r2 =( a + b) then

1. r1 + r2 =(aa + bb) + (a + b)

2. r1 r2 = (aa + bb) (a + b) = (aaa + aab + bba + bbb)

3. (r1)* =(aa + bb)*

Regular Languages

• Definition:

called a regular language.

Note

• It is to be noted that if r1, r2 are regular expressions,

corresponding to the languages L1 and L2 then the

languages generated by r1 + r2 , r1r2 ( or r2 r1) and

r1*( or r2*) are also regular languages.

Example

generated by r1+ r2, is also a regular language,

expressed by (aa+bb)+(a+b)

• If r1=(aa+bb) and r2=(a+b) then the language of

strings generated by r1r2, is also a regular language,

expressed by (aa+bb)(a+b)

• If r=(aa+bb) then the language of strings generated by

r*, is also a regular language, expressed by (aa+bb)*

All finite languages are regular

• Example:

strings of length 2, starting with a, then

L={aa, ab}, may be expressed by the regular

expression aa+ab.

Note

• It may be noted that if a language contains even

thousand words, its RE may be expressed, placing ‘ + ’

between all the words.

bba, bbb}, that may be expressed by a RE

aaa+aab+aba+abb+baa+bab+bba+bbb, which is

equivalent to (a+b)(a+b)(a+b).

Finite Automata

Defining Languages (continued)…

Method 4 (Finite Automaton)

• Definition:

A Finite automaton (FA), is a collection of the followings

1. Finite number of states, having one initial and some (may

be none) final states.

2. Finite set of input letters (Σ) from which input strings are

formed.

3. Finite set of transitions i.e. for each state and for each

input letter there is a transition showing how to move

from one state to another.

Example

• Σ = {a,b}

• States: x, y, z where x is an initial state and z is final state.

• Transitions:

1. At state x reading a go to state z,

2. At state x reading b go to state y,

3. At state y reading a, b go to state y

4. At state z reading a, b go to state z

Example Continued …

• These transitions can be expressed by the following table called

transition table

Note

• It may be noted that the information of an FA, given

in the previous table, can also be depicted by the

following diagram, called the transition diagram, of

the given FA

Remark

• The previous transition diagram is an FA accepting the language of

strings, defined over Σ={a, b}, starting with a. It may be noted that

this language may be expressed by the regular expression

a (a + b)*

Note

• It may be noted that to indicate the initial state, an

arrow head can also be placed before that state and

that the final state with double circle, as shown

below. It is also to be noted that while expressing an

FA by its transition diagram, the labels of states are

not necessary.

Example

Σ = {a,b}

Transitions:

1. At state x reading a or b go to state y.

2. At state y reading a or b go to state x.

Example Continued …

• These transitions can be expressed by the following transition table

Example Continued …

• It may be noted that the previous transition table may be depicted by

the following transition diagram.

Example Continued …

• The previous transition diagram is an FA accepting the language of

strings, defined over Σ={a, b} of even length. It may be noted that this

language may be expressed by the regular expression

((a+ b) (a + b))*

TASK

Σ={a, b}, of odd length.

Example

• Consider the language L of strings, defined over Σ={a,

b}, starting with b. The language L may be expressed

by RE b(a + b)* , may be accepted by the following FA

Example:

• Consider the language L of strings, defined over Σ={a, b}, ending in a.

The language L may be expressed by RE (a+b)*a

Example Continued …

language.

Example continued …

Note

language there may be more than one FA accepting

that language, but for a given FA there is a unique

language accepted by that FA.

Note

• It is to be noted that given the languages L1 and L2

,where

• L1 = The language of strings, defined over Σ={a, b},

beginning with a

• L2 = The language of strings, defined over Σ={a,

b}, not beginning with b

This fact may be depicted by the corresponding

transition diagrams of L1 and L2.

FA1 Corresponding to L1

expression a(a + b)*

FA2 Corresponding to L2

expression a (a + b)* + Λ

Example

• Consider the Language L of Strings of length two or

more, defined over Σ = {a, b}, beginning with and

ending in same letters.

• The language L may be expressed by the following

regular expression

a (a + b)* a + b (a + b)* b

• It is to be noted that if the condition on the length of

string is not imposed in the above language then the

strings a and b will then belong to the language.

Example Continued …

Example

{a, b}, beginning with and ending in different letters.

regular expression

a (a + b)* b + b (a + b)* a

Example Continued …

Example

• Consider the Language L , defined over

Σ = {a, b} of all strings including Λ, The language L

may be accepted by the following FA

FA

Example Continued …

(a + b)*

Example

• Consider the Language L , defined over Σ = {a,

b} of all non empty strings. The language L may be

accepted by the following FA

following regular expression (a + b)+

Example

• Consider the following FA, defined over Σ = {a,

b}

any string. Even it does not accept the null string. As

there is no path starting from initial state and ending

in final state.

Equivalent FAs

the same language, as shown in the following FAs.

Equivalent FAs Continued …

• FA1

• FA2

• FA3

Note (Equivalent FAs)

• FA1 has already been discussed, while in FA2, there is

no final state and in FA3, there is a final state but FA3

is disconnected as the states 2 and 3 are

disconnected.

language) of strings accepted by FA1 , FA2 and FA3 is

denoted by the empty set i.e.

{ } OR Ø

Example

{a, b}, containing double a.

regular expression

(a+b)* (aa) (a+b)*

Example Continued …

- weebly whole group mathEnviado porapi-246761114
- AWK PrimerEnviado porshico1973
- 171782511 Elain Rich Automa Computiability and ComplexityEnviado porkevin
- FSAEnviado porAbhishekSharma
- 231_BLUECOAT-SGOS_CMG_5.1.4_10.pdfEnviado porMaria Pastor
- 2. RE TheoremsEnviado porneha_gupta_91
- Exercise Questions on Regular Language and Regular ExpressionEnviado porAnonymous t1W5G4UZw
- Ages aptitude questionsEnviado porbcramc
- 13 a 05404062017Enviado porBibek Brahma
- Basic ProxyS super practicEnviado porDeepu
- ch9Enviado porSai Ram DA
- Ptyhon Strings.odtEnviado porJeremy Farrell
- MIT6_096IAP11_lec04Enviado porMourad Taj
- Turing - Early Personal Life EducationEnviado porffZ
- 07Python6.pdfEnviado porSam
- Salesforce Useful Validation FormulasEnviado porDiwaker
- TOC Question PaperEnviado porRaja Prabhu
- Regular PumpingEnviado porSualeih Gero
- Comparison of TeX Editors - Wikipedia, The Free EncyclopediaEnviado porTeo Andrade Farfán
- NEW LOGICEnviado porAdri Miller
- half2Enviado porCrystal
- Recursive sequences solution.pdfEnviado porChai Usajai Usajai
- DiaryEnviado porDominguez Ronald
- T_DE1Enviado porAu Lam
- Lab Manual 1Enviado porShaeshita Babu
- tocEnviado porgirirajvyas2
- Support Vector MachineEnviado porZakky Dayat
- Relative Resource ManagerEnviado porsamity
- XIJeigenvalues.pdfEnviado porRuqayyahAL-Furqan
- R1-074489 {Uplink Power Control}Enviado porpraveenkmr78

- TOC unit 4.pdfEnviado porKniturse
- Finalised Modified Copy of Pcd Lab ManualEnviado porcsesathya
- TOC handbook 2016-17.docEnviado porSrinivas Kanakala
- TOC_Questions_012210030237_1Enviado porPrabhu Dhandapani
- 10.String HandlingEnviado porqwernasd
- Learning Outcome CompilerEnviado porSandeep K. Budhani
- Theory of Automata - CS402 Solved McqsEnviado porSaddam Lashari
- System Software Module 3Enviado porarunlalds
- CFGEnviado porAwais_Khan_5673
- CA448 Lexical Analysis 2pEnviado portaherakhans
- FlatEnviado porPrathyusha Lakshmi
- Lecture 01Enviado porlucky
- CS1303 Theory of ComputationEnviado porShanmugasundaram Muthuswamy
- FunctionEnviado pormsh
- Cs402 Collection of Old PapersEnviado porcs619finalproject.com
- Theory of Automata and Formal LanguagesEnviado poranuraggupta85
- Antlr C Sharp Code Generation Using Visual Studio.netEnviado poryailsk8
- Lesson 1 - Python GrammarEnviado porgoblinph
- Unit 2 Lexical AnalyzerEnviado porRashi Nigam
- lexyaccEnviado porAnushree Ghosh
- 16-regexp-ocamllexEnviado porImran Hayder
- CD Previous QA 2010Enviado porSagar
- 13 a 05404062017Enviado porBibek Brahma
- 2.2Enviado porGaurav Pitaliya
- 2011-0103 14 Formal LanguagesEnviado porshubham
- Cs 701 CompilerEnviado porswapnil_joshi_55
- CSharp_Programs Very ImportantEnviado portmrajghat_247145222
- Compiler_Lecture_top down.pdfEnviado porHasanen10
- ASG -Ans.docEnviado porrmidhunajyothi
- UntitledEnviado porRevathy Jayabaskar