For More Question Papers Visit - www.pediawikiblog.com 1.5CsIIS54 .'

.:

)

Fifth Semester B.E. Degree Examination, Dec.2017/Jan.29;18 Automata Theory & Compatibility' . Time: 3 hrs,

FIVEfull ote: Answer . 1

.'

Max. Marks: 80

co m

<

.

questions, choosing one full question/rom 'each module. ..

" Module-l Define the fo llowing terms with examples: (i) Alphabet (ii) Power of an alphabet (iii) Concatenation (iv) Languages (04 Marks) Draw a DFA to accept strings of a's and b's ending with 'bab' _ ,', (03 Marks) Convert the following NDF M Fig. Q I (c) to its equivalentl)FSM. (09 Marks)

a.

lo

g.

b. c.

Fig. QI (c)

OR Draw a OF M to accept the language,

b.

L = {w E {a,b '
r:

ib

a.

r

Marks)

rs-ro--T -

ik

2

B A A C D Bt D AI 0 F' G E

G

F G

aw

.A B C *0 E F

a.

di

w

3

II 0 (i) Draw the table ofdistinguishable and indt tinguishahle state for the automata. (09 Marks) (ii) Construct minimum tate equivalent of automata. Write differences between DFA, FA and E- FA. (04 Marks) Module-2 Consider the DF A shown below:

.p e

c.

G

3

w w

Obtain the regular expres ions R,/o, R'J possible.

2

o c

~ o

0.

E

b.

is

and simplify the regular expressions

!)

z

I

>.

Give Regular expressions for the following languages on (i) (ii)

all strings containing exactly one a all strings containing no more than 3 a's.

(iii)

all string

I =- {a, b.c]

that contam at least one occurance of each symbol in

much.as

(O~..Mllrks)

I

.

(03 Marks)

I of3

For More Question Papers Visit - www.pediawikiblog.com

.""\

3

\

~,,'." bet L be the language

accepted

,..... - .... \ '.

by the following

(04 Mar

finite state machine.

b

,

For *v Papers Visit - www.pediawikiblog.com .:<~ ".:'-More Question

;

f, .'

Fig. Q3 (c) l~r each of the following

(i)

(a (;

.

regular

expressions,

whether

(ii)

(€,u~b)a(bb * a) *

(iii)

bauabl4
(i)

(aub'a)(bb*a)*

. a.

\

OR

Prove that the following

Jarig~1age in not regular: \, " . L2 are regular languages then prove

b.

If LI and

c.

languages. Is the following S ~ iC + S I iC

that

LJ uL2,

Ll.L2 and

grammar + SeS I a

is ambiguous? ,

"

(06 Marks)

,

B~SbSIAlbb Let G be the grammar,

' .)

r...

bA aSJ bAA

(09 Marks)

w

B~blbSlaBB

(03 Marks)

for each.

ib

Define Grammar, Derivation, Sentential forms and give one example What is CNF? Obtain the following grammar In CNF S~ASBIE A~aASla

S ~aBI A ~al

L'J are regular

ik

c.

(05 Marks)

.~

'

(05 Marks)

Module-3 a. b.

,

a.

\.

/

\.

ed

.......

ia

For the string aaabbabbba find a (i) Left most derivation, (ii) Rigti~most derivation, (iii) Pats~iree. , -

6

Explain the-following (i) (,; Pushdown (u)' Languages

b. _,S::~n~tr'uct a PDA

(04 Marks)

OR

terms: automata (PDA). of a PDA.

Instantaneous

.p

~ Qii)/

L:

,

L = {onI 11'1 n > O}. I

C~b

5

describes

ba )bb * a

/

4

it correctly

lo g. co m

Indicate

to

description

accept

the


of a PDA. language

L

= ~WR

IW

E

{a, b}'}.

Draw

Marks)

the' graphical

w w

w

representation ofthi PDA, Show the moves made by this PDA for the string aabbaa. ----~-~ (10 Marks) c. Convert the following CFG (0 PDA S~aABBlaAA

A~aBBla

B~

bBBIA

c-»

(03 Marks)

2 of3

For More Question Papers Visit - www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com 15~SIIS54

I 7

1/;;

Module-4

!l-:-::::I.f;L1 and L2 are context free languages then prove that LI U L2' L\ . L2 and L"I~

~ntext

6

n(; ,ATe~~anguages. b. vG~ __ a.decision procedure to answer each of the following questions: \' ..{1) "Given a regular expression a and a PDA M, the language accep~~ M a subset .r.: "Ir--i· (", 0¥ the language generated by a? r: v <~/ (ii), ,)Given a context-free Grammar G and two strings SI and S2, [email protected]'J1 generate S,S2? (iii)\~9iV~Q a context free Grammar G, does G generate any even.))e..~ strings. (iv) 'G~v..e',t a Regular Grammar G, is L(G) context-free? . ' (12 Marks) 04 Marks)

(,

{

/..;\\.

/~',

v~"

. ~ OR (OS Marks) Explain with nea~ ~i~&ram, the working of a Turing Machine ~j9r Design a Turing mic~~\ to accept the language L = {a I} . Draw the transition diagram. Show the m(1f~~~ade by this turing machine f<;R~e\s'tring aabbcc. (11 Marks)

»>: '

<"''//,:; :

8

:

lo g. co m

,~\@

a.

n~~~J?{>=

b.

' --;>!->~.'>

\'"

\

a. b. c.

-..

'

1,/'·....... r ,

-II

...),- .•

e .

(16 Marks)

ib

9

«\~y

'-..." Module-5 ..," Write short notes on: ( (' ,; I--::'I.~~""·) Multi-tape turing machine, '--\.) ~ '.Q.()/ ~>Y'l;:/' Non-deterministic turing machille:; . "-./ \ / Lmear Bounded automata. ,:: .-/ r::'\... \,/ '-

/

" /i{)R '. ~'

"

Write short notes on: Undecidable languages. Halting problem ofturing machine. . The post correspondence problem"

10

/.

.J

ik

a. b. c.

V'

'v

w

-,

,,***** ,,>}

",-,'

.;'-

/"

. )' 1 -- /

w w

w

.p

ed

ia

"

\

(/ ./

-.

,' -,,' 'J

3 of 3

For More Question Papers Visit - www.pediawikiblog.com

(16 Marks)

Automata Theory Jan 2018 (2015 Scheme).pdf

Explain the-following terms: (i) (,; Pushdown automata (PDA). (u)' Languages of a PDA. ~ Qii)/ Instantaneous description of a PDA.

2MB Sizes 1 Downloads 125 Views

Recommend Documents

Railways Jan 2018 (2015 Scheme).pdf
the layout ofa B.G yard, calculate the super elevation and the speed on the branch line if the ... Estimate the quantities of materials required to construct one km long BG railway ... Explain briefly the various classification of a railway station.

Graph Theory Jan 2018 (2010 Scheme).pdf
the graph and its dual. Fig.Q2(b) (06 Marks). c. Find the chromatic polynomial and chromatic number for the graph shown in Fig.Q2(c). bFig.Q2(c) (OSMarks).

Jan/July 2015
School of Education ... a) Explain the concept of educational technology. ... a) Describe the process of communication and the ways to overcome the barriers to.

Jan.2018.pdf
Spelling Bee. 22. 23. Early Dismissal ... card. If you need to add someone. you must come into the. office. Inspire Empower ... Displaying Jan.2018.pdf. Page 1 of 1.

Tourist Arrivals Jan 2015.pdf
Hong Kong 35.857 1,35 19.499 0,85 83,89. Japan 121.926 ... Source of Data : Immigration Bureau, Police Department. ... Displaying Tourist Arrivals Jan 2015.pdf.

Jan Feb 2015 Newsletter.pdf
emeritus at California State University, East. Bay, and an ... Poets, Vets & Bargirls; Love, California. Style; and .... Page 3 of 8. Jan Feb 2015 Newsletter.pdf.

Newsletter 25 Jan 2015 final.pdf
Page 1 of 4. CHURCH OF SAINT MARY. 25 January 2015. Third Sunday in Ordinary Time. 4 HOLLY PLACE. LONDON, NW3 6QU. Telephone: 020 7435 6678.

36029_2017_Order_04-Jan-2018.pdf
6 days ago - Date : 04-01-2018 This petition was called on for hearing today. CORAM : HON'BLE THE CHIEF JUSTICE. HON'BLE MR. JUSTICE A.M. KHANWILKAR. HON'BLE DR. JUSTICE D.Y. CHANDRACHUD. For Petitioner(s) Mr. Tushar Mehta, ASG. Ms. Anindita Pujari,

30892_2016_Judgement_09-Jan-2018.pdf
is sung, the concept of protocol associated with it. has its inherent roots in National identity, National. integrity and Constitutional Patriotism. (d) All the cinema halls in India shall play the. National Anthem before the feature film starts and.

32405_2017_Order_18-Jan-2018.pdf
Page 1 of 1. ITEM NO.3 COURT NO.4 SECTION III. S U P R E M E C O U R T O F I N D I A. RECORD OF PROCEEDINGS. Petition(s) for Special Leave to Appeal (C) No(s).28035/2017. (Arising out of impugned final judgment and order dated 20-07-2017. in MCA No.