Scribd
Upload
43 views

Automata Theory Lecture No: 8

This document discusses transition graphs (TGs) which are used to represent finite automata. A TG consists of: 1) A finite number of states including at least one start state and some number of final states. 2) A finite set of input symbols used to form input strings. 3) Transitions between states based on reading input symbols, which may determine if a string is accepted. The document provides examples of TGs that accept or don't accept certain languages to illustrate the concepts.

Uploaded by

Syed Abrar Shah
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
43 views

Automata Theory Lecture No: 8

This document discusses transition graphs (TGs) which are used to represent finite automata. A TG consists of: 1) A finite number of states including at least one start state and some number of final states. 2) A finite set of input symbols used to form input strings. 3) Transitions between states based on reading input symbols, which may determine if a string is accepted. The document provides examples of TGs that accept or don't accept certain languages to illustrate the concepts.

Uploaded by

Syed Abrar Shah
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/ 7

Automata Theory

Lecture No: 8

Method 5 (Transition Graph)


Definition:
A Transition graph (TG), is a collection of the followings
Finite number of states, at least one of which is start stat
some (maybe none) final states.Finite set of input letters
which input strings are formed.
Finite set of transitions that show how to go from one sta
another based on reading specified substrings ofinput le
possibly even the null string ().

Note

It is to be noted that in TG there may exist more


than one paths for certain string, while there
may not exist any
path for certain string as well. If there exists at
least one path for a certain string, starting from
initial state and
ending in a final state, the string is supposed to
be accepted by the TG, otherwise the string is

Example
Consider the Language L , defined over = {a, b}
of all strings including . The language L may be
accepted by the following TG

The language L may also be accepted by the


following TG
TG 1

TG 2

Example
Consider the following TGs
TG 1
TG 2
TG 3
It may be observed that in the first TG, no transition has been
shown. Hence this TG does not accept any string, defined over any
alphabet. In TG 2 there are transitions for a and b at initial state
but there is no transition at state1. This TG still does not accept
any string. In TG3 there are transitions at both initial state and
state 1, but it doesnot accept any string.
Thus none of TG 1 , TG 2 and TG 3 accepts any string, i.e. these
TGs accept empty language. It may be noted that TG 1 and TG 2 are
TGs but not FA, while TG 3 is both TG and FA as well.
It may be noted that every FA is a TG as well, but the converse may

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 TG

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

Example
Consider the Language L of strings, defined over
= {a, b}, containing double a. The language L may
be expressed by the following regular expression
(a+b) * (aa) (a+b) * . This language may be
accepted by the following TG

Example
Consider the language L of strings, defined over
={a, b}, having double a or double b.
The language L can be expressed by RE (a+b) *
(aa + bb) (a+b) *.
The above language may also be expressed by
the following TGs.

Note
In the above TG if the states are not labeled then

You might also like