UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank...

33
UNIT-I Finite State Machines Q.1) Construct a deterministic finite automata (DFA) that recognizes the language L= {x ϵ (0,l) | (x contains at least two consecutive 0’s) and (x does not contain two consecutive l’s)} (4 Marks Aug-2015 INSEM) Q.2) Convert the given NFA−ε to an NFA. (6 Marks Aug-2015 INSEM) Q.3) Minimize the following automata. (4 Marks Aug-2015 INSEM) Q.4) Convert Following Moore Machine into Mealy Machine. (6 Marks Aug-2015 INSEM) Present State Next State Output a = 0 a = 1 -> q0 q3 q1 1 q1 q2 q3 0 q2 q2 q1 0 q3 q1 q0 1 Q.5) Define and compare NFA and DFA. (4 Marks Aug-2014 INSEM)

Transcript of UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank...

Page 1: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

UNIT-I Finite State Machines

Q.1) Construct a deterministic finite automata (DFA) that recognizes the language

L= {x ϵ (0,l) | (x contains at least two consecutive 0’s) and (x does not contain two

consecutive l’s)} (4 Marks Aug-2015 INSEM)

Q.2) Convert the given NFA−ε to an NFA. (6 Marks Aug-2015 INSEM)

Q.3) Minimize the following automata. (4 Marks Aug-2015 INSEM)

Q.4) Convert Following Moore Machine into Mealy Machine. (6 Marks Aug-2015

INSEM)

Present State Next State

Output a = 0 a = 1

-> q0 q3 q1 1

q1 q2 q3 0

q2 q2 q1 0

q3 q1 q0 1

Q.5) Define and compare NFA and DFA. (4 Marks Aug-2014 INSEM)

Page 2: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.6) Design finite automation for the following (6 Marks Aug-2014 INSEM)

i. FA which reads strings made up of {0, l} and accepts only those strings which

end in either ‘00’ or ‘ll’.

ii. FA which accepts only those strings with ‘a’ at every even position. ∑={a,b}.

Q.7) Define and compare Moore and Mealy machines. (4 Marks Aug-2014

INSEM)

Q.8) Construct Mealy machine equivalent to the given Moore machine. (6 Marks

Aug-2014 INSEM)

0 1 O/P

q0 q0 q1 N

q1 q0 q2 N

q2 q0 q3 N

q3 q0 q3 Y

Start state : q0 ; Final state : q3

Q.9) Define the following terms. (6 Marks May-2013,2016 ENDSEM)

1) Symbol 2) Language 3) Kleene closure

Q.10) Design a Finite Automata FA which accepts odd number of 0’S an even

number of 1’s. (6 Marks May-2013 ENDSEM)

Q.11) Design NFA which accepts the string containing either “01” or “10” over

Σ={0,1}. (6 Marks May-2013 ENDSEM)

Q.12) Convert the following mealy machine into equivalent Moore machine. (6

Marks May-2013 ENDSEM)

Page 3: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.12) Construct an equivalent DFA for given NFA

M={{q, p, r, s, t},{0,1},𝛿,p,{t}}

where 𝛿 is defined in the following table. (6 Marks May-2013 ENDSEM)

𝛿 0 1

{p}

{t}

{q,r}

𝜙

{p,s}

{p,t}

{t}

𝜙

𝜙

𝜙

{p,t}

{t}

{q,r}

𝜙

{p,s}

𝜙

{q,r}

{q,r}

Q.13) Construct Moore machine equivalent for the given Mealy machine. (6 Marks

May-2015 ENDSEM)

Q. 14 Design a DFA for accepting L over {0,l} such that every substring of length 4

contains at least three l’s. . (4 Marks May-2015 ENDSEM)

Q.15) Construct NFA accepting language represented by 0*l*2* and convert it into

DFA. (6 Marks May-2015 ENDSEM)

Q.16) Explain the Basic Finite Automata? What are the various application &

limitation of it? (6 Marks May-2016 ENDSEM)

Page 4: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.16) Obtain a DFA equivalent to the NFA. (4 Marks May-2016 ENDSEM)

Q.17) Construct FA that accepts even number of zeros & odd number of ones. (4

Marks May-2017 ENDSEM)

Q.18) Construct a Moore machine to find out the residue-modulo-3 for binary

number. (6 Marks May-2017 ENDSEM)

Q.19) Define regular sets. List out closure properties of regular sets. (4 Marks May-

2017 ENDSEM)

Q.20) Design a DFA that read strings made up of I = {0, 1} and accept only those

strings which ends with 00 or 11. (8 Marks Nov-2014 ENDSEM)

Q.21) State and explain properties of FSM. (2 Marks Nov-2014 ENDSEM)

Q.22) Design a finite state machine for divisibility by 5 tester of a given decimal

number. (8 Marks Nov-2014 ENDSEM)

Q.23) Design a Mealy machine to accept binary strings having 101 or 110 as

substring. (8 Marks Nov-2014 ENDSEM)

Q.24) Convert following NFA into equivalent DFA,

M = ({q0, q1,}, {0,1,}, δ, q0, {q1}) where

δ (q0, 0) = {q0, q1,}

δ (q0,1,) = {q1}

δ (q1,1) = { q0, q1}

(8 Marks Nov-2014 ENDSEM)

Page 5: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.25) Construct the minimum state automation equivalent to the transition diagram

given as below:

(6 Marks Nov-2014 ENDSEM)

Q.26) Design an FA for the languages that contain strings with next-to-last symbol 0.

(5 Marks Nov-2015 ENDSEM)

Q.27) Write formal definition of NFA - 2. Also define ε – closure.

(5 Marks Nov-2015 ENDSEM)

Q.28) Draw an FA recognizing the regular language corresponding to give regular

expression. (5 Marks Nov-2015 ENDSEM)

1(01 + 10)* + 0 (11 + 10)*

Q.29) Design FA/FSM accept only those strings which ending with “abb” over input =

{a, b}. (8 Marks Nov-2016 ENDSEM)

Q.30) Design a finite automata which perform addition of two Binary number. (8 Marks

Nov-2016 ENDSEM)

Q.31) Define Finite State Machine. Explain its properties and limitations. (4 Marks

Nov-2016 ENDSEM)

Q.32) Design a Mealy machine to check divisibility of decimal number by 4. (8 Marks

Nov-2016 ENDSEM)

Q.33) Construct NFA and its equivalent DFA for accepting a language defined over input

= {0, l} such that each string has two consecutive zeros followed by l. (8 Marks Nov-

2016 ENDSEM)

Q.34) Construct a deterministic finite automata (DFA) for accepting L over (0, l) such that

every substring of length 4 contains at least three l’s. (6 Marks Nov-2016 ENDSEM)

Page 6: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.35) Construct Moore machine for given Mealy machine. (6 Marks Nov-2016 ENDSEM)

Q.36) Define the following with suitable examples. (4 Marks Nov-2017 ENDSEM)

i) FA

ii) Regular Expression

Q.37) Convert Mealy machine to Moore machine. (6 Marks Nov-2017 ENDSEM)

Q.38) Design Moore machine for divisibility by 3 tester for binary number. (6 Marks Nov-

2017 ENDSEM)

Q.39) Design Finite Automata to accept strings ending with 00 or ll. (4 Marks Nov-2017

ENDSEM)

Page 7: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

UNIT-II Regular Expressions

Q.1) Construct DFA for the R.E l0 + (0 + ll) ( 6 Marks Nov-2016)

Q.2) State the pumping lemma theorem for regular sets. Show that the language L =

{0n | n is prime} is not regular. (4 Marks Nov-2016)

Q.3) Using Pumping lemma, Prove that L = {Oi2 / i is an integer, i > l} is not-

regular. (6 Marks NOV-2017)

Q.4) Discuss Applications of FA & regular expressions. (4 Marks NOV-2017)

Q.5) Define the following with suitable examples (4 Marks NOV-2017)

i. FA

ii. Regular Expression

Q.6) Find the regular expression for the following: (4 Marks NOV-2017)

i)

ii)

Q.7) Prove that the following language is non-regular, using pumping lemma.

L = {anbn |n>0} (6 Marks NOV-2017)

Q.7) Show that (0 +l)* = (0* l*)* (4 Marks Nov-2016)

Q.8) Give RE for following language over = {0, l} (6 Marks Nov-2016)

i. The language of all strings containing exactly two 0’s.

ii. The language of all strings containing at least two 0’s.

iii. The language of all strings not containing the substring 00

Page 8: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.8) Draw an FA recognizing the regular language corresponding to give regular

expression. (5 Marks NOV-2015)

1(01 + 10)* + 0 (11 + 10)*

Q.9) Write a short note on the applications of Regular Expressions. (5 Marks NOV-

2015)

Q.10) Using Pumping lemma for the regular sets Prove the language L = {ai2 | i is

an integer, i ≥ l} is not- regular. (6 Marks NOV-2015)

Q.11) Construct Regular Expression for the following transition diagram using

Arden’s theorem. (4 Marks NOV-2015)

Q.12) What is Regular Expression ‘r’. Give RE for the following language over {0,

1}. (6 Marks NOV-2014)

i. Language of all strings that begin and end with 101.

ii. If L(r) = {00, 010, 0110, 01110, .....}.

Q.13) Show that (a* b*)*=(a +b)* (4 Marks Nov-2014)

Q.14) Construct DFA for regular expression (a + b)* abb. (8 Marks Nov-2014)

Q.15) Construct NFA for following regular expressions. (8 Marks Nov-2014)

i. a * b (a + b)*

ii. (aa + bb)* bb (a + b)*

Q.16) Explain properties of regular expression. (6 Marks Nov-2014)

Q.17) Write formal definition of regular expression with suitable example. State

Arden’s theorem and its use. (4 Marks May-2017)

Page 9: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.18) Define regular sets. List out closure properties of regular sets. (4 Marks May

-2017)

Q.19) Describe in the simple English the language defined by the following RE.

(6 Marks May-2016)

i. (a+b)* a (a+b)*

ii. (01*0)* 1

iii. a(a+b)*bb

Q.20) Construct a FA for given regular expression (10)* 101(01)*. (4 Marks May-

2016)

Q.21) Let ∑ = {a,b}. Write RE to define language consisting of strings such that

i. Strings without substring bb

ii. Strings that have exactly one double letter in them. (4 Marks May-2015)

Q.22) With examples define Regular Expression. (2 Marks May-2015)

Q.23) Find RE for the following DFA using Arden’s theorem. (4 Marks May-2015)

Q.24) Find all possible regular expression over L⊆{0,1}*. (4 Marks May-2013)

i. The set & all possible string containing

ii. The set of all string that do not end with “01”.

Q.25) Construct a DFA for the regular expression (a+b)*(baaa). (6 Marks May-

2013)

Page 10: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.26) Define regular expressions. Give RE for the following over ∑= {0,1}

i. All binary strings with at least one 0.

ii. All binary strings with at most one 0. (6 Marks Aug-2014 INSEM)

Q.27) Find the regular expression corresponding to each of the following subset of

{0, l}.(4 Marks Aug-2015 INSEM)

i. Language of all Strings not containing the substring 000.

ii. Language of all Strings containing an even no of 0’s.

Q.28) Show that L={anb2n | n>0} is not regular. (6 Marks Aug-2015 INSEM)

Q.29) Construct a regular expression for given finite automata. (6 Marks Aug-2015

INSEM)

Page 11: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

UNIT-III CONTEXT FREE GRAMMAR AND LANGUAGES

Question Bank

Q.1) Consider the following CFG:

G = {(S, A), (a, b), P, S}

Where P consists of :

S→ aAs|a

A→SbA|ss|ba

Derive string 'aabbaa' using leftmost & right most derivation

(4 Marks Aug-2017 InSem)

Q.2) Convert given CFG into GNF

S→ Bs | Aa

A→ Bc

B→ Ac where,

V = {S, A, B} & T = {a, c}. (6 Marks Aug-2017 InSem)

Q.3) Eliminate the ε- productions from the Grammar G which is defined as:

S→ ABA

A→ aA | ε

B→ bB | ε (6 Marks Aug-2017 InSem)

Q.4) Write CFG for the following Languages

i) L = {ai bj ck / i= j + k}

ii) L = {a2n bc/ n≥ 1} (6 Marks Aug-2017 InSem)

Page 12: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.5) Convert given CFG to GNF

S →AB

A→ BS | b

B → SA | a (6 Marks May-2017 EndSem)

Q.6) Consider CFG with productions

S → aB/bA

A → a/aS/bAA

B → b/bS/aBB

For string “aaabbabbba” Find leftmost and rightmost derivation.

(4 Marks May-2017 EndSem)

Q.7) Convert the following grammar to their equivalent CNF.

S→ PQP

P → aP|ε

Q → bQ|ε. (6 Marks May-2017 EndSem)

Q.7) Convert Left Linear Grammar to equivalent Right Linear Grammar.

S → C0 | A0 | Bl

A → Al | C0 | Bl | 0

B → Bl | l

C → A0 (4 Marks May-2017 EndSem)

Q.8) Simplify the following grammar

S→ a | Xb | aYa

X→Y| ε

Y→b |X (5 Marks May-2017 EndSem)

Page 13: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.9) Write an equivalent left-linear grammar for the right-linear grammar which is

defined as :

S→ 0A |1B

A → 0C|1A | 0

B→1B|1A |1

C→ 0 | 0A. (5 Marks May-2017 EndSem)

Q.8) Check whether the following grammar is ambiguous: if it is ambiguous, remove

the ambiguity and write an equivalent unambiguous grammar

E→E + E|E – E | E* E | E / E |(E)|id (6 Marks May-2017 EndSem)

Q.9) Convert the given CFG G =({s},{a}, p,s ) into CNF.

S→ aaaaaS | aaa (4 Marks May-2017 EndSem)

Q.10) Write CFG for the following languages (5 Marks Aug-2016 InSem)

i. L = {anbn | n>=1}

ii. (baa + abb)*

Q.11) Simplify the given grammar (5 Marks Aug-2016 InSem)

S → aC | SB

A → bSCa

B → aSB | bBC

C → aBC | ad

Q.12) Define the following with suitable example (6 Marks Aug-2016 InSem)

i. Regular grammar

ii. Ambiguous grammar

Page 14: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.13) Convert the following grammar to CNF (4 Marks Aug-2016 InSem)

S → Aba | aab

A → aS

Q.14) Convert the given regular grammar to its equivalent FA.

S → aS / bS / aA

A → bB

B → aC

C → a (8 Marks Aug-2014 InSem)

Q.15) Define regular grammar. (2 Marks Aug-2014 InSem)

Q.16) Write a CFG for (6 Marks Aug-2014 InSem)

i) Generating strings containing any no. (zero or more) of a’s. = {a}

ii) a*b*

Q.17) Write a note on Chomsky hierarchy. (4Marks Aug-2014, Aug-2015 InSem,

6 Marks Nov-2017 End Sem)

Q.18) With examples define CNF and GNF. (4 Marks Aug-2014 InSem)

Q.19) Simplify the given grammar (6 Marks Aug-2014 InSem)

S → aAa

A → Sb / bCC / DaA

C → abb / DD

E → aC

D → aDa

Q.21) Convert the following grammar in Chomsky NF.

S→ 0lXY

X→ lXY | ε

Y→YX0 | X | ε (8 Marks Aug-2015 InSem)

Page 15: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.22) Define Context free Grammar with example. (2 Marks Aug-2015 InSem)

Q.23) Convert Right Linear Grammar to equivalent Left Linear grammar

S->bB

B->bC

B->aB

C->a

B->b (4 Marks Aug-2015 InSem)

Q.24) Write a context free grammar for following Language. (6 Marks Aug-2015 InSem)

i) L= {ambncp | m+n=p}

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

Q.25) Check whether or not the following grammar is ambiguous; if it is ambiguous,

remove the ambiguity and write an equivalent unambiguous grammar.

S → aS | aSbS | ε

(6 Marks Nov-2017 End Sem)

Q.26) Convert the following CFG into CNF (4 Marks Nov-2017 End Sem)

S→ 0Al | 0BA

A → S0l | 0

B → lB | l

Q.27) Convert given CFG to GNF. (6 Marks Nov-2016 End Sem)

S->AA | 0

A-> SS | l

Page 16: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.28) Consider CFG with productions (4 Marks Nov-2016 End Sem)

S->baXaS | ab

X->Xab | aa

If w = baaaababaab, then give rigtmost derivation and leftmost derivation of w.

Q.29) Convert the following grammar to their equivalent CNF.

S->lA | 0B

A->lAA | 0S | 0

B->0BB | lS | l (6 Marks Nov-2016 End Sem)

Q.30) Convert Left Linear Grammar to equivalent Right linear Grammar.

S->C0 | A0 | Bl

A->Al | C0 | Bl | 0

B->Bl | l

C->A0 (4 Marks Nov-2016 End Sem)

Q.31) Define (5 Marks Nov-2015 End Sem)

i) Ambiguous Grammar

ii) Regular Grammar with suitable example.

Q.32) Convert given CFG into Greibach Normal Form

S → ABA

A → aA|c

B → bB|c (5 Marks Nov-2015 End Sem)

Q.33) State pumping Lemma for context - free languages. Also Define context - free

language. (5 Marks Nov-2015 End Sem)

Q.34) Construct parse trees for the strings using specified derivation format for the

given grammar G.

G = ({S, A, B}, {a, b}, P, {S})

Page 17: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

P = {

S → aB | bA

A → a | aS | bAA

B → b | bS | aBB }

Strings: -

i) aaabbb (rightmost derivation)

ii) aababb (leftmost derivation)

(6 Marks Nov-2015 End Sem)

Q.35) Obtain regular expression to the following regular grammar [4]

S→ aA | bB

A → bA | a

B→ aB | b (4 Marks may-2016 End Sem)

Q.36) Simplify given grammar

S → AaA

A → Sb | bcc | ε

C → cc | abb (6 Marks may-2016 End Sem)

Q.37) Define ambiguous Grammar. Show given Grammar is ambiguous or not.

S → aSbS | bSaS | ε (4 Marks may-2016 End Sem)

Q.38) Define derivation tree with suitable example. (2 Marks may-2016 End Sem)

Page 18: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

UNIT-IV PUSHDOWN AUTOMATA AND POST MACHINES Question Bank

Q.1) Construct PDA that accepts language. (8 Marks Nov-2017 EndSem) L = { an bm cn | m, n > l} Q.2) Construct PDA to check for well formedness of paranthesis. Write ID for

i) (( ) ( ))

ii) (( )) (8 Marks Nov-2017 EndSem)

Q.3) Construct Post Machine which accepts the string over Σ = {a, b} containing odd length & the element at the centre as 'a'. Write simulation for the string “abbabba”. (8 Marks Nov-2017 EndSem)

Q.4) Convert the following CFG into CNF & construct PDA for the same.[8]

S → 0Al | 0BA

A → S0l | 0

B → lB | l (8 Marks Nov-2017 EndSem)

Q.5)   Design a post machine that accepts the following language.

L={anbnan | n>0} (8 Marks Nov-2017 EndSem(2012 Pattern))

Q.6) Explain the following using suitable examples.

I. Acceptance of a CFL by empty stack by a PDA. II. Acceptance of a CFL by final state by a PDA.

(8 Marks Nov-2017 EndSem(2012 Pattern))

Q.7) Construct a PDA for the language described as “The set of all strings over ={a, b} with equal no. of a’s and b’s.

(8 Marks Nov-2017 EndSem(2012 Pattern))

Q.8) Give formal definitions of PDA and PM. Compare them. (8 Marks Nov-2017 EndSem(2012 Pattern))

Page 19: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.9) Define PDA (4 Marks Nov-2016 EndSem(2012 Pattern)) I. Through final state

II. Through empty stack

Q.8) Design a PDA for the language L = {anbmcn| m, n > =l} by empty stack.

(8 Marks Nov-2016 EndSem(2012 Pattern))

Q.9) Construct PDA equivalent to the following CFG.

S->0Al|0BA

A->S0l|0

B->lB|l (8 Marks Nov-2016 EndSem(2012 Pattern)) 

Q.10) Design PM to for L ={anbncn | n    0} Can you design NPDA for same? Justify. (8 Marks Nov-2016 EndSem(2012 Pattern))

Q.11) Compare the power of Post machine and Push down Automata. (8 Marks Nov-2016 EndSem(2012 Pattern))

Q.12) Construct PDA which accepts the language generated by the following CFG for arithmetic operations S-> S+S |S*S| 4.

(8 Marks Nov-2016 EndSem(2008 Pattern))

Q.13) Define post machines. Compare PDA and post machine.

(8 Marks Nov-2016 EndSem(2008 Pattern))

 

Q.14) Write a short note on closure properties of CFLs.

(8 Marks Nov-2016 EndSem(2008 Pattern))

Q.15) Design PDA to accept the language L = {an b2n | n > l} by a final state.

(8 Marks Nov-2016 EndSem(2008 Pattern))

Q.16) Design a PDA which accepts only odd number of a’s over Σ = {a, b}. Simulate PDA for the string “aabab”. (6 Marks Aug-2014 InSem)

(9 Marks Nov-2015 EndSem(2012 Pattern))

Q.17) Define PDA and Post machine with suitable example. Compare DPDA, NPDA and CFG. (9 Marks Nov-2015 EndSem(2012 Pattern))

Page 20: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.18) Compare PDA and post machine. Design a post machine to accept the language L = {an bn+1 | n >= 0}. (9 Marks Nov-2015 EndSem(2012 Pattern))

Q.19) Construct a PDA that accepts the following language using CNF.

L ={a2n | n > 0 } (8 Marks Nov-2014 EndSem(2012 Pattern))

Q.21)Write formal definition of PDA. Explain its elements. What are different types of PDA? What are the applications of PDA ? (8 Marks Nov-2014 EndSem(2012 Pattern))

Q.22) Design a PDA accepting {an bman | m,n 1 } simulate a PDA for the string

“aabaa”. (8 Marks Nov-2014 EndSem(2012 Pattern))

Q.23) Define post machine. Explain its elements. Show that the post machine is more powerful that PDA. (8 Marks Nov-2014 EndSem(2012 Pattern))

Q.24) Show that CFLs are closed under union, Concatenation and Kleene closure. (8 Marks Nov-2014 EndSem(2008 Pattern)) Q.25) State and prove pumping lemma for context-free-language. (8 Marks Nov-2014 EndSem(2008 Pattern)) Q.26) Compare PDA with FSM and construct PDA for well formedness of Parenthesis ∑ = {(,)}. (8 Marks Nov-2014 EndSem(2008 Pattern))

Q.27) Define post machine and explain its elements. (4 Marks Nov-2014 EndSem(2008 Pattern)) Q.28) Define acceptance by PDA, (4 Marks Nov-2014 EndSem(2008 Pattern))

I. By Final State II. By Empty Stack.

Q.29) Show that post machine has more power than PDA and compare PDA with PM. (8 Marks Nov-2014 EndSem(2008 Pattern))

Q.30) Obtain a PDA to accept the language L = {an bn | n 1} by final state.

(8 Marks Nov-2014 EndSem(2008 Pattern)) Q.31) Construct PDA to accept the strings containing equal no. of a’s & b’s Over Σ={a ,b}. (8 Marks MAY-2018 EndSem) Write ID for

I. abbaab. II. aabb.

Q.32) Design a PM that checks if the given string contains well-formed parenthesis. Simulate for (( ) ( )). (8 Marks MAY-2018 EndSem)

Page 21: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.33) Construct a PDA that accepts the language L={an bm an |m,n 1} .Write ID for (8 Marks MAY-2018 EndSem)

i) aabbaa.

ii) abbba

Q.34) Construct PDA for the following language.

L = (a 2n b n | n 1) (8 Marks MAY-2018 EndSem) Q.35) Write a note on closure properties of CFL's. (6 Marks MAY-2018 EndSem) Q.36) Let L= {ambn | n < m} Construct. (8 Marks MAY-2018(2012 Pattern) EndSem)

I. CFG accepting L II. PDA accepting L by empty store

III. PDA accepting L by final state Q.37) Construct PDA equivalent to the following CFG ,

S -> 0Al|0BA A -> S0l|0 B -> lB|l (8 Marks MAY-2018(2012 Pattern) EndSem)

Q.38) Design PM for L = {anbn | n > = 0}. (8 Marks MAY-2018(2012 Pattern) EndSem)

Q.39) Compare the power of Post machine and Push down Automata. (4 Marks MAY-2018(2012 Pattern) EndSem)

Q.40) Construct a PDA for the language generated by the following grammar. SaB | bA A bAA | a | aS B b | bS | aBB (8 Marks MAY-2017(2012 Pattern) EndSem)

Q.40) Define post machine. Compare FA, PDA and post machines. (8 Marks MAY-2017(2012 Pattern) EndSem)

Q.41) Design a PDA that checks wellformedness of parentheses. Simulate PDA for (( ) ( ( )) ). (8 Marks MAY-2017(2012 Pattern) EndSem)

Q.42) Define and compare DPDA and NPDA. Justify that NPDA is more powerful than DPDA. (8 Marks MAY-2017(2012 Pattern) EndSem)

Q.43) Give formal Definition of Push Down automata & applications of PDA. (8 Marks MAY-2016(2012 Pattern) EndSem)

Q.44) Construct a PDA accepting L={wcwR|w is in (a/b)* and wR is reverse of w}. (8 Marks MAY-2016(2012 Pattern) EndSem)

Page 22: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.45) Prove that the Language L={ww | w is in(0+1)*}is not a CFL. (6 Marks MAY-2016(2012 Pattern) EndSem)

Q.46) Write short note on post machine with example. (6 Marks MAY-2016(2012 Pattern) EndSem)

Q.47) Construct a PDA equivalent to following grammar S aAA A aS | bS | a (4 Marks MAY-2016(2012 Pattern) EndSem)

Q.48) Construct a PDA to accept the language {an bm c(n+m) /where n,m > =l}. (6 Marks MAY-2015(2012 Pattern) EndSem)

Q.49) Construct PDA equivalent to the given CFG: S OAl | OBA A S0l | 0 B lB | l

(8 Marks MAY-2015(2012 Pattern) EndSem)

Q.50) Compare PDA and FA. (4 Marks MAY-2015(2012 Pattern) EndSem) Q.51) Construct a post m/c to accept the language {anbn+1/where n > = l}. (8 Marks MAY-2015(2012 Pattern) EndSem) Q.52) Define Post Machine. (2 Marks MAY-2015(2012 Pattern) EndSem)

Q.53) Check whether the given language is CFL or not. L={0N1 N 2 N | n ≥1 } (8 Marks MAY-2013(2003 Pattern) EndSem)

Q.54) Show that L={WW | W∈ {a,b}*} is not CFL . (6 Marks MAY-2013(2003 Pattern) EndSem)

Q.55) Construct a PDA that accepts the language L={an b2n | n ≥ 1} (10 Marks MAY-2013(2003 Pattern) EndSem)

Q.56) Define PDA Discuss the various applications of PDA. (04 Marks MAY-2013(2003 Pattern) EndSem)

Q.57) Write and Explain closure properties of CFL.

(04 Marks MAY-2013(2003 Pattern) EndSem)

Q.58) Construct PDA equivalent to CFG, which defines language containing all string only with equal number of a’s & b’s. Simulate working of this PDA for the input is “aabb”. (08 Marks MAY-2013(2003 Pattern) EndSem)

Page 23: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Unit-V TURING MACHINES

Question Bank

Problems

Q.1) Design a TM which compares two positive integers m & n and produces

output Gt if m > n ; Lt if m < n; and Eq if m = n ;

Write simulation for the input

I. m = l, n = 2.

II. m = n = 2 (12 Marks May-2018 EndSem)

Q.2) Construct TM for the language L = {an bn cn | n > 0}

(10 Marks May-2018 EndSem)

Q.3) Design a TM to find the value of log2 (n) where n is any binary number & a

perfect power of 2. (08 Marks May-2018 EndSem)

Q.4) Design a TM that multiplies two unary numbers.

Write simulation for the strings. ll & lll. (10 Marks Nov-2017 EndSem)

Q.5) Design TM to find 2's complement. (06 Marks Nov-2017 EndSem)

Q.6) Construct a TM to compute

f (a, b) = a − b where a > b

= 0 where a < b (10 Marks Nov-2017 EndSem)

Q.7) Construct TM for obtaining 2’s complement of a binary number. Simulate

TM for any input. (08 Marks May-2018(2012 Pattern) EndSem)

Q.8) Design a Turing Machine to add two unary numbers. (08 Marks May-

2018(2012 Pattern) EndSem)

Q. 9) Design a TM that adds two unary numbers. Show stepwise functioning of

TM for the input: ll + lll. (10 Marks Nov-2016(2012 Pattern) EndSem)

Q.10) Construct TM for the following: (10 Marks Nov-2016(2012

Pattern) EndSem)

I. Language consisting of string having any number of 0’s & even number

of l’s over ∑= {0, 1}.

II. Increment the value of any binary number by one.

Page 24: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.11) Design a Turing Machine to add two unary numbers. (08 Marks Nov-

2016(2012 Pattern) EndSem)

Q.12) Construct TM to replace string ll0 by l0l in binary input string. (08 Marks

Nov-2016(2012 Pattern) EndSem)

Q.13) Design a Turing machine to compute 2’s complement of given binary

number. (08 Marks Nov-2016(2008 Pattern) EndSem)

Q.14) Design a Turing machine to add two unary numbers. (08 Marks Nov-

2016(2008 Pattern) EndSem)

Q.15) Construct a TM for obtaining two’s complement of a given binary number.

Simulate TM for any string. (08 Marks Nov-2015(2012 Pattern) EndSem)

Q.16) Design a turing machine that accepts the language of all strings which

contain ‘aba’ as a substring. (04 Marks Nov-2015(2012 Pattern) EndSem)

Q.17) Design a TM which accepts all strings of the form an bn for n 1 and rejects

all other strings. Draw the transition diagram. Simulate TM for some string.

(08 Marks Nov-2014 (2012 Pattern) EndSem)

Q.18) Design a TM to add two unary numbers. (08 Marks Nov-2014 (2012

Pattern) EndSem)

Q.19) Design a TM that recognizes a string containing aba as a substring. (06

Marks Nov-2014 (2012 Pattern) EndSem)

Q.20) Design a Turing machine to compute 2’s complement of a given binary

number. (08 Marks Nov-2014(2008 Pattern) EndSem)

Q.21) Design a Turing machine for concatenation of two strings over input {a, b}.

(08 Marks Nov-2014(2008 Pattern) EndSem)

Q.22) Design a Turing Machine to recognize the language L = {ln 2n 3n | n>=l}.

Simulate TM for “ll2233”. (10 Marks May-2017(2012 Pattern) EndSem)

Q.23) Design a Turing machine that accepts L = {0nln | n<=l}. Simulate TM for

“000lll”. (10 Marks May-2017(2012 Pattern) EndSem)

Q.24) Construct a Turing machine to perform mod 2 operation on given binary

number retain original number as well as store result after number separated by

blank. (08 Marks May-2016(2012 Pattern) EndSem)

Page 25: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.25) Construct a Turing machine to perform the two’s complement of give n

binary number. (08 Marks May-2016(2012 Pattern) EndSem)

Q.26) Design a TM that computes the function

f (x, y) = x + y if x y

= 0 if x < y where x & y are unary.

Simulate the working of the TM for x = 2, y = 2.

(12 Marks May-2015(2012 Pattern) EndSem)

Q.27) Define Turing Machine and construct a TM which recognizes strings

consisting of equal no. of 0’s and l’s. (08 Marks May-2015(2012 Pattern)

EndSem)

Q.28) Design Tm to accept the set L of all strings formed with 0&1 and having

substring 000. (08 Marks May-2013(2003 Pattern) EndSem)

Q.29) Design a TM to recognize palindrome string over {a,b}. (08 Marks May-

2013(2003 Pattern) EndSem)

Theory Questions

Q. Write short note on UTM. (06 Marks May-2018 EndSem)

Q. Compare FA and TM. (04 Marks Nov-2017 EndSem)

Q. Define Recursive languages & Recursively enumerable languages with

example. (04 Marks Nov-2017 EndSem)

Q. Explain Multitape TM. (02 Marks Nov-2017 EndSem)

Q. Write short note on Halting problem of TM. (08 Marks May-2018(2012

Pattern) EndSem)

Q. Explain Universal Turing machine. (04 Marks May-2018(2012 Pattern)

EndSem)

Q. Differentiate between FA, PDA and TM. (04 Marks May-2018(2012

Pattern) EndSem)

Q. Write a short note on: (08 Marks Nov-2017(2012 Pattern) EndSem)

I. Power of TM over finite state machine.

II. Universal Turing machine

Page 26: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q. Define TM. Explain its working. Give the types of TM & applications of the

same. (08 Marks Nov-2017(2012 Pattern) EndSem)

Q. Explain Halting problem of TM. (04 Marks Nov-2016(2012 Pattern)

EndSem)

Q. Differentiate between FA, PDA and TM. (04 Marks Nov-2016(2012

Pattern) EndSem)

Q. Write short note on Universal Turing machine. (08 Marks Nov-2016(2012

Pattern) EndSem)

Q. Write short notes on: (08 Marks Nov-2016(2008 Pattern) EndSem)

I. Nondeterministic Turing Machine.

II. Halting Problem of Turing Machine.

Q. Write short notes on: (08 Marks Nov-2016(2008 Pattern) EndSem)

I. Limitations of TM

II. Universal Turing Machine.

Q. Write a short note on: (08 Marks Nov-2015(2012 Pattern) EndSem)

i) Multi - tape TM

ii) Universal TM

Q. Compare FM, PDA, PM and TM with respect to language, grammar,

powerfulness and example. (08 Marks Nov-2015(2012 Pattern) EndSem)

Q. Discuss categories of problems based on solvability with suitable example.

(04 Marks Nov-2015(2012 Pattern) EndSem)

Q. Write a note on each of the following:

I. Recursively enumerable language.

II. Recursive language.

III. Recursive Functions.

IV. Partial Recursive function.

(08 Marks Nov-2015(2012 Pattern) EndSem)

Q. Write a short note on Encoding of Turing Machine. (08 Marks Nov-

2015(2012 Pattern) EndSem)

Q. Write short notes on : (08 Marks Nov-2014 (2012 Pattern) EndSem)

Page 27: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

I. Universal Turing Machine

II. Multi-tape Turing Machine.

Q. Write a short note on Non deterministic Turing Machine. (04 Marks Nov-

2014 (2012 Pattern) EndSem)

Q. Write a short note on halting problem of a Turing machine. (08 Marks Nov-

2014(2012 Pattern) EndSem)

Q. Write a short note on universal Turing machine. (08 Marks Nov-2014(2008

Pattern) EndSem)

Q. Write a short notes on : (08 Marks Nov-2014(2008 Pattern) EndSem)

I. Limitation of turing machine

II. Halting problem of turing machine.

Q. Write a short note on: (08 Marks May-2017(2012 Pattern) EndSem)

I. Church Turing Hypothesis

II. Post correspondence problem

Q. Explain the following for a TM. (08 Marks May-2017(2012 Pattern) EndSem)

I. Power of TM over finite state machine

II. Universal TM

Q. Differentiate between FA, PDA, and TM. (04 Marks May-2016(2012

Pattern) EndSem)

Q. Write short note on multi tape Turing machine. (04 Marks May-2016(2012

Pattern) EndSem)

Q. Write short note on universal Turing machine. (08 Marks May-2016(2012

Pattern) EndSem)

Q. Compare FA, PDA and TM. (04 Marks May-2015(2012 Pattern)

EndSem)

Q. Explain the halting problem of turing machines. (04 Marks May-2015(2012

Pattern) EndSem)

Q. Explain the diff. types of turing machines. (04 Marks May-2015(2012

Pattern) EndSem)

Page 28: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q. Explain the following . (08 Marks May-2015(2012 Pattern) EndSem)

I. Universal TM

II. Halting problem in TM.

Page 29: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Unit-VI COMPUTATIONAL COMPLEXITY

Question Bank

Problems

Q.1) Prove that following are decidable languages.

1. ACFG ={<G,W> |G is a CFG that generates string W)

2. ECFG ={<G,W> |G is CFG &L(G) =Φ}

(10 Marks May-2018 Endsem, Nov-2017 Endsem)

Q.2) Prove that PCP= {<P> |P is an instance of the post correspondence problem

with a match} is undecidable. (08 Marks May-2018 Endsem)

Q.3) Prove that, (10 Marks Nov-2017 Endsem)

HALTM = {<M, W> | M is a TM & M Halts on input W} is undecidable.

Q.4) Explain post-correspondence problem.

Let Σ = {0, 1} and let A & B defined as shown in the table. Find the post

correspondence sequence of integers i1, i2, iS ......., im for m ≥ 1 such that wi1, wi2,

......., wim = si1, si2, ......, sim. (08 Marks Nov-2015 Endsem (2012 pattern))

A B

i wi xi

1 0 000

2 01000 01

3 01 1

Theory Questions

Q.1) Define the class P & Class NP problems with example.

(06 Marks May-2018 Endsem)

Q.2) Explain Turing Reducibility with example. (08 Marks May-2018 Endsem)

Page 30: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.3) Explain Post Correspondence Problem with example. (08 Marks May-2018

Endsem (2012 pattern))

Q.4) Explain recursive language and recursively enumerable language with

suitable example. (08 Marks May-2018 Endsem (2012 pattern))

Q.5) Define decidability of problem. Describe undecidable problems for Context

Free Grammar. (08 Marks May-2018 Endsem (2012 pattern))

Q.6) Write short note on: (08 Marks May-18,Nov-16 Endsem (2012 pattern))

I. Turing Reducibility

II. Multitape TM

Q.7) Write short note on NP completeness with examples. (06 Marks Nov-2017

Endsem)

Q.8) Write short notes on: (08 Marks Nov-2017 Endsem)

I. PCP

II. Measuring complexity

Q.9) What is reducibility? What are undecidable problems? Describe at least four

undecidable problems in case of TMs. (08 Marks Nov-2017 Endsem (2012

pattern))

Q.10) Write a short note on encoding of TM. (08 Marks Nov-2017 Endsem

(2012 pattern))

Q.11) Write a short note on church Turing hypothesis. (04 Marks Nov-2017

Endsem (2012 pattern))

Q.12) Describe at least four undecidable problems in case of CFGs. (04 Marks

Nov-2017 Endsem (2012 pattern))

Q.13) Define recursively enumerable languages and recursive languages with

suitable example. (08 Marks Nov-2017, May-2015 Endsem (2012 pattern))

Q.14) Explain Halting problem of TM. (04 Marks Nov-2016 Endsem (2012

pattern))

Page 31: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

Q.15) Explain Post Correspondence Problem with example. (08 Marks Nov-

2016 Endsem (2012 pattern))

Q.16) Explain recursive language and recursively enumerable language with

suitable example. (08 Marks Nov-2016 Endsem (2012 pattern))

Q.17) Define decidability of problem with example. Describe undecidable

problems for Context Free Grammar. (08 Marks Nov-2016 Endsem (2012

pattern))

Q.18) Write short notes on: (08 Marks Nov-2016 Endsem (2008 pattern))

1. Nondeterministic Turing Machine.

2. Halting Problem of Turing Machine

Q.19) Write short notes on: (08 Marks Nov-2016 Endsem (2008 pattern))

1. Limitations of TM.

2. Universal Turing Machine

Q.20) Compare FM, PDA, PM and TM with respect to language, grammar,

powerfulness and example. (08 Marks Nov-2015 Endsem (2012 pattern))

Q.21) Discuss categories of problems based on solvability with suitable example.

(04 Marks Nov-2015 Endsem (2012 pattern))

Q.22) Define decidability of problem with suitable example. Describe undecidable

problems for context-free Grammar. (08 Marks Nov-2015 Endsem (2012

pattern))

Q.23) Define decidability. How to prove the given language is undecidable ? List

some undecidable problems. (08 Marks Nov-2014 Endsem (2012 pattern))

Q.24) Write a short note on halting problem of a Turing machine. (08 Marks

Nov-2014 Endsem (2012 pattern))

Q.25) Show that for two recursive languages L1 & L2, each of the following is

recursive. (08 Marks Nov-2014 Endsem (2012 pattern))

Page 32: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

1. L1 ∩L2

2. L1 U L2

Q.26) Write a short note on decidable problems concerning

1. Context free languages

2. Turing machines

(08 Marks May-2017 Endsem (2012 pattern))

Q.27) what is reducibility? What are undecidable problems? Describe at least four

undecidable problems in case of CFGs. (08 Marks May-2017 Endsem (2012

pattern))

Q.28) Describe post correspondence problem. PCP is an unsolvable problem.

Justify. (08 Marks May-2017 Endsem (2012 pattern))

Q.29) what are recursive and recursively enumerable languages? What is the

relation between them? (08 Marks May-2017 Endsem (2012 pattern))

Q.30) Write short note on post correspondence problem (PCP). (04 Marks May-

2016 Endsem (2012 pattern))

Q.31) Explain with example decidable & non decidable language. (06 Marks

May-2016 Endsem (2012 pattern))

Q.32) Explain with example Turing Reducibility. (06 Marks May-2016

Endsem (2012 pattern))

Q.33) write short note on recursive language & recursively enumerable language

with suitable example. (06 Marks May-2016 Endsem (2012 pattern))

Q.34) Show that following decision problems are recursive.

1. NFA accepts a word or not.

2. CEG G generates the string w or not.

(10 Marks May-2016 Endsem (2012 pattern))

Q.35) Prove that the following decision problems are recursive.

Page 33: UNIT-I Finite State Machines - Impetus & Conceptsfaculty.pictinc.org/LectureNotes/Question Bank Unitwise.pdf · 2019. 3. 1. · UNIT-I Finite State Machines Q.1) Construct a deterministic

1. DFA accepts a word or not.

2. CEG G generates the string w or not.

(10 Marks May-2015 Endsem (2012 pattern))

Q.36) Prove that the following decision problems are recursive.

1. Two DFA’s are equivalent or not.

2. NFA Accepts a word or not.

(10 Marks May-2015 Endsem (2012 pattern))

Q.37) Explain with example Turing Reducibility.

(06 Marks May-2015 Endsem (2012 pattern))