Scribd
Upload
7 views20 pages

Lesson 09

Uploaded by

youzii2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
7 views20 pages

Lesson 09

Uploaded by

youzii2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Recap lecture 8

 TG definition, Examples:accepting all


strings, accepting none, starting with
b, not ending in b, containing aa,
containing aa or bb

1
Task Solution

 Build a TG accepting the language L of


strings, defined over Σ={a, b}, ending in
b.
 Solution The language L may be
expressed by RE (a + b)*b, may be
accepted
a,b by the following TG

––
b +

2
Example

Consider the language L of strings,


defined over Σ={a, b}, having triple a
or triple b. The language L may be
expressed by RE
(a+b)* (aaa + bbb) (a+b)*
This language may be accepted by the
following TG

3
Example Continued …
2 a
4

a
a
a,b a,b

1– 6+

b b

3 b 5
4
OR

a,b a,b

aaa,bbb
- +

5
OR

a,b a,b

aaa
1- 2+

a,b a,b

bbb
3- 4+

6
Example

Consider the language L of strings,


defined over Σ = {a, b}, beginning and
ending in different letters.
The language L may be expressed by RE
a(a + b)*b + b(a + b)*a
The language L may be accepted by the
following TG

7
Example continued …

a, b

2 b
4+
a

1- a,b
b

3 a
5+

8
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
This language may be accepted by the
following TG
9
Example Continued …

a, b

2 a
4+
a

1- a,b
b
b
3 5+

10
Task

Build a TG accepting the language L of


strings, defined over Σ={a, b},
beginning with and ending in the
same letters.

11
Example

 Consider the EVEN-EVEN language,


defined over Σ={a, b}. As discussed
earlier that EVEN-EVEN language can
be expressed by a regular expression
(aa+bb+(ab+ba)(aa+bb)*(ab+ba))*
The language EVEN-EVEN may be
accepted by the following TG

12
Example continued …

aa,bb aa,bb
ab,ba

1 2
ab,ba

13
Example

 Consider the language L, defined over Σ={a,


b}, in which a’s occur only in even clumps
and that ends in three or more b’s. The
language L can be expressed by its regular
expression
(aa)*b(b*+(aa(aa)*b)*) bb
OR
(aa)*b(b*+( (aa)+b)*) bb
The language L may be accepted by the following
TG

14
Example Continued …

aa b
b
1 b 2 b +
-
aa

15
Example:
Consider the following TG
b
4 b
a a,b
- +
bbb
a a a
ab
bbb

1 b 3
a
bb 2 bb 16
Example Continued …

 Consider the string abbbabbbabba. It may


be observed that the above string traces
the following three paths, (using the
states)
1) (a)(b) (b) (b) (ab) (bb) (a) (bb) (a)
(-)(4)(4)(+)(+)(3)(2)(2)(1)(+)
2) (a)(b) ((b)(b)) (ab) (bb) (a) (bb) (a)
(-)(4)(+)(+)(+)(3)(2)(2)(1)(+)
3) (a) ((b) (b)) (b) (ab) (bb) (a) (bb) (a)
(-) (4)(4)(4)(+) (3)(2)(2)(1)(+)
17
Example Continued …

Which shows that all these paths are


successful, (i.e. the path starting from an
initial state and ending in a final state).
Hence the string abbbabbbabba is accepted
by the given TG.

18
Generalized Transition Graphs

A generalized transition graph (GTG) is a


collection of three things
1) Finite number of states, at least one of
which is start state and some (maybe
none) final states.
2) Finite set of input letters (Σ) from which
input strings are formed.
3) Directed edges connecting some pair of
states labeled with regular expression.
It may be noted that in GTG, the labels of
transition edges are corresponding regular
expressions
19
Summing Up

 TGs accepting the languages:


containing aaa or bbb, beginning and
ending in different letters, beginning
and ending in same letters, EVEN-
EVEN, a’s occur in even clumps and
ends in three or more b’s, example
showing different paths traced by
one string, Definition of GTG

20

You might also like