正则表达式定义与有限自动机等价性5regular expressions min.pdfVIP

RE’s:Introduction

◆Regularexpressionsdescribe

languagesbyanalgebra.

◆Theydescribeexactlytheregular

languages.

◆IfEisaregularexpression,thenL(E)is

thelanguageitdefines.

◆We’lldescribeRE’sandtheirlanguages

recursively.

2

OperationsonLanguages

◆RE’susethreeoperations:union,

concatenation,andKleenestar.

◆Theunionoflanguagesistheusual

thing,sincelanguagesaresets.

◆Example:{01,111,10}∪{00,01}=

{01,111,10,00}.

3

Concatenation

◆TheconcatenationoflanguagesLandM

isdenotedLM.

◆Itcontainseverystringwxsuchthatwis

inLandxisinM.

◆Example:{01,111,10}{00,01}=

{0100,0101,11100,11101,1000,

1001}.

4

KleeneStar

◆IfLisalanguage,thenL*,theKleene

starorjust“star,”isthesetofstrings

formedbyconcatenatingzeroormore

stringsfromL,inanyorder.

◆L*={ε}∪L∪LL∪LLL∪…

◆Example:{0,10}*={ε,0,10,00,010,

100,1010,…}

5

RE’s:Definition

◆Basis1:Ifaisanysymbol,thenaisa

RE,andL(a)={a}.

◗Note:{a}isthelanguagecontainingone

string,andthatstringisoflength1.

◆Basis2:εisaRE,andL(ε)={ε}.

◆Basis3:∅isaRE,andL(∅)=∅.

6

RE’s:Definition–(2)

◆Induction1:IfE1andE2areregular

expressions,thenE1+E2isaregular

expression,andL(E+E)=L(E)∪L(E).