|
CS402
|
Which Of The Following Statement Is Not True
|
Fa Can Be Considered To Be An Nfa
|
Fa Can Be Considered To Be An Nfa With Null String
|
Nfa Can Be Considered To Be An Tg
|
Tg Can Be Considered To Be An Nfa
|
D
|
|
CS402
|
According To 3Rd Part Of The Kleene’S Theorem If A Language Can Be Accepted By An Re Then It Can Be Accepted By A ___________ As Well
|
Tg
|
Fa
|
G And Fa
|
None Of These
|
C
|
|
CS402
|
__________ States Are Called The Halt States
|
Accept And Reject
|
Accept And Read
|
Accept And Start
|
Accept And Write
|
A
|
|
CS402
|
The Input String Is Placed Before It Runs In
|
Stack
|
Memory
|
Tape
|
Ram
|
C
|
|
CS402
|
If L1 And L2 Are Two Regular Languages Then L1nL2 Is Also
|
Regular
|
None Regular
|
Finite
|
None Infinite
|
A
|
|
CS402
|
Tm Is More Powerful Than Fsm Because
|
The Tape Movement Is Confined To One Direction
|
It Has No Finite State Control
|
It Has The Capability To Remember Arbitrary Long Sequences Of Input Symbols
|
None Of These
|
B
|
|
CS402
|
One Language Can Represents More Than One Re
|
True
|
Falss
|
Can’T Be Assumed
|
Non Of Given
|
A
|
|
CS402
|
Gtg Can Have __________ Final State
|
0
|
1
|
More Than 1
|
All Of The Given
|
D
|
|
CS402
|
According To Mayhill Nerode Theorem If L Generates Finite No. Of Classes Then L Is __________
|
Regular
|
Nonregular
|
Infinite
|
Infinite
|
A
|
|
CS402
|
Pda Stands For __________
|
Push And Drop Automaton
|
Pop And Drop Automaton
|
Push Down Automaton
|
None Of Given Options
|
C
|
|
CS402
|
Consider A Language L Defined Over An Alphabet ? If Two Strings X And Y Defined Over ? Are Run Over An Fa Accepting The Language L Then X And Y Are Said To Belong To The Same ___________ If They End In The Same ___________
|
Class State
|
Final Infinite
|
Regular Nonregular
|
All Of Above
|
A
|
|
CS402
|
One Fa Has 3 States And 2 Letters In The Alphabet. Then Fa Will Have __________ Number Of Transitions In The Diagram
|
4
|
5
|
6
|
7
|
C
|
|
CS402
|
In Fa Starting State Is Represented By A __________ Sign
|
+
|
-
|
*
|
S
|
A
|
|
CS402
|
Re For The Language Defined Over S={A B} Having Words Starting With A Is__________
|
A(A+B)*
|
(A+B)*A
|
(A+B)*
|
None Of These
|
A
|
|
CS402
|
The Regular Expression Defining The Language L1 U L2 Can Be Obtained Converting And Reducing The Previous ---------- Into A ------------ As After Eliminating States
|
Gtg Tg
|
Fa Gtg
|
Fa Tg
|
Tg Re
|
B
|
|
CS402
|
It Is Very Important To Determine Which Sequences Of Rows Do Correspond To Possible Paths Through The
|
Cfg
|
Cfl
|
Pda
|
Tape
|
C
|
|
CS402
|
The Pda Is Called Non-Deterministic Pda When There Are More Than One Out Going Edges From……… State
|
Start Or Read
|
Pop Or Reject
|
Read Or Pop
|
Push Or Pop
|
C
|
|
CS402
|
Length Of Null String Is
|
Always Not Equal To 0
|
Always Equal To 0
|
It Has Variable Length
|
All Are True
|
B
|
|
CS402
|
Which Of The Following Is Not A Word Of Language Equal?
|
Aaabbb
|
Abbbabaa
|
Abababa
|
Bbbaaa
|
C
|
|
CS402
|
= Language Of Words Containing Even Number Of A’S. Regular Expression Is
|
(A+B)*Aa(A+B)*
|
(B+Ab*A)*
|
A+Bb*Aab*A
|
(A+B)*Ab(A+B)*
|
B
|