|
CS402
|
S={A Aa Abb} Then String Aaaabbaa Has __________ Length
|
1
|
2
|
3
|
4
|
D
|
|
CS402
|
The Two Fas Are
|
Same
|
Equivalent
|
Different
|
None Of Them
|
B
|
|
CS402
|
(A + B)* A Is Re For The Language Defined Over S={A B} Having Words Not Ending In B
|
True
|
False
|
Such A Language Is Not Regular
|
None Of The Given Options
|
A
|
|
CS402
|
According To Theory Of Automata There
|
1
|
2
|
3
|
4
|
B
|
|
CS402
|
Length Of Strings Generated By Infinite Language Is
|
Finite
|
Infinite
|
Depends On The Language
|
None Of These
|
A
|
|
CS402
|
Two Machines Are Said To Be Equivalent If They Print The Same Output String When The Different Input String Is Run On Them
|
True
|
False
|
Depends On Language
|
May Be Or May Not Be
|
B
|
|
CS402
|
One Fa Has N States And M Letters In The Alphabet. Then Fa Will Have Number Of Transitions In The Diagram
|
(N)+(M)
|
(M)-(N)
|
(M)(N) Or (N)(M)
|
None Of The Given Options
|
C
|
|
CS402
|
For Every Three Regular Expressions R S And T The Languages Denoted By R(S U T) And (Rs) U (Rt) Are The Same
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
Between The Two Consecutive Joints On A Path
|
One Character Can Be Pushed And One Character Can Be Popped
|
Any No. Of Characters Can Be Pushed And One Character Can Be Popped
|
One Character Can Be Pushed And Any No. Of Characters Can Be Popped
|
Any No. Of Characters Can Be Pushed And Any No. Of Characters Can Be Popped
|
B
|
|
CS402
|
The Language Q Is Infinite
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
“One Language Can Be Expressed By More Than One Nfa”. This Statement Is __________
|
True
|
False
|
Depends On Nfa
|
None Of The Given
|
A
|
|
CS402
|
One Language Can Have ___________ Cfg(S)
|
At Least One
|
At Least Two
|
At Least Three
|
None Of Them
|
A
|
|
CS402
|
S= {A Bc Cc} Has The Latters
|
1
|
2
|
3
|
4
|
C
|
|
CS402
|
S ? Axb|Bxa X ? Ax|Bx|? The Given Cfg Generates The Language Of Strings In English __________
|
Beginning And Ending In Different Letters
|
Beginning And Ending In Same Letter
|
Having Even-Even Language
|
None Of Given
|
A
|
|
CS402
|
“Every Infinite Language Is Regular” This Statement Is
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
While Finding Re Corresponding To Tg We Connect The New Start State To The Old Start State By The Transition Labeled By
|
A
|
B
|
Null String
|
None Of The Given Options
|
C
|
|
CS402
|
If L1 And L2 Are Regular Languages Then Which Statement Is Not True?
|
(L1/L2 Is Always Regular)
|
L1+L2 Are Always Regular
|
L1*L2 Are Always Regular
|
None Of Them
|
A
|
|
CS402
|
All Nonnull Words Of The Cfl Can Be Generated By The Corresponding Cfg Which Is In Cnf I.E The Grammar In Cnf Will Generate The Same Language Except The
|
String
|
Regular Language
|
Null String
|
Non Of Above
|
C
|
|
CS402
|
According To Theory Of Automata There Are ___________ Types Of Languages
|
1
|
2
|
3
|
4
|
B
|
|
CS402
|
(A+B)*A(A+B)*B(A+B)* Is The Re Of Language Defined Over ={A B} Having At Least One A And One B
|
True
|
False
|
Such A Language Does Not Exist
|
None Of These
|
A
|