|
CS402
|
No164: If R1 = (Aa + Bb) And R2 = ( A + B) Then The Language (A + B)* (Aa + Bb)* Will Be Generated By
|
(R2)(R1)
|
(R1 + R2)*
|
(R2)*(R1)*
|
(R1)*
|
D
|
|
CS402
|
Which Statement Is True?
|
The Tape Of Turing Machine Is Infinite
|
The Tape Of Turing Machine Is Finite
|
The Tape Of Turing Machine Is Infinite When The Language Is Regular
|
The Tape Of Turing Machine Is Finite When The Language Is Nonregular
|
A
|
|
CS402
|
“Every Finite Language Can Be Expressed By Fa”. This Statement Is __________
|
True
|
False
|
Depends On Language
|
None Of These
|
A
|
|
CS402
|
The Languages -------------- Are The Examples Of Non Regular Languages
|
Even-Even And Prime
|
Palindrome And Prime
|
Palindrome And Even-Even
|
Factorial And Squre
|
B
|
|
CS402
|
For Fa Corresponding To (L1nL2C)U (L1CnL2) The Regular Expression Ca Be Determined That Defines The Language Accepted By This
|
Tg
|
Gfc
|
Fa
|
Gtg
|
C
|
|
CS402
|
Gtg Can Have __________ Initial State
|
Zero
|
One
|
More Than One
|
One Or More Than One
|
D
|
|
CS402
|
The Cfg Is Said To Be Ambiguous If There Exists Atleast One Word Of Its Language That Can Be Generated By The Different Production Trees
|
True
|
False
|
Depends On The Language
|
None Of The Given Options
|
A
|
|
CS402
|
Grammatical Rules Which Involve The Meaning Of Words Are Called __________
|
Semantics
|
Syntactic
|
Both A And B
|
None Of Given
|
A
|
|
CS402
|
The Cfg Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The __________
|
One
|
Two
|
More Than One
|
At Most One
|
C
|
|
CS402
|
Every Fa Should Be __________
|
Deterministic
|
Non- Deterministic
|
Deterministic & Non- Deterministic
|
None Of These
|
A
|
|
CS402
|
If In An Nfa ^ Is Allowed To Be A Label Of An Edge Then That Nfa Is Called ___________
|
Will Not Remain Nfa
|
Nfa With
|
Nfa With Null String
|
Either Nfa With Null String Or Nfa With
|
C
|
|
CS402
|
In Tg There May Be A Transition For Null String
|
True
|
False
|
Can’T Show Transition For String
|
None Of These
|
A
|
|
CS402
|
Gtg Can Have __________ Final State
|
0
|
1
|
More Than 1
|
All Of The Given
|
D
|
|
CS402
|
The __________ Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The Different Production Tree
|
Cfl
|
Cfg
|
Gtg
|
None Of The Given
|
B
|
|
CS402
|
And R2 = ( A + B) Then The Language (Aa + Bb)(A + B) Will Be Generated By
|
(R1 + R2)
|
(R2)(R1)
|
(R1)*
|
(R1)(R2)
|
A
|
|
CS402
|
The Language Q Is Said To Be Quotient Of Two Regular Languages P And R Denoted By--- If Pq=R
|
R=Q/P
|
Q=R/P
|
Q=P/R
|
P=R/Q
|
B
|
|
CS402
|
In Polish Notation (O-O-O) Is The Abbreviation Of__________?
|
Operand - Operator – Operand
|
Operand - Operand- Operator
|
Operator -Operand – Operand
|
Operand -Operand – Operand
|
C
|
|
CS402
|
The Same Non Terminals Can Be Written In Single Line If They Have More Than One __________
|
Productions
|
Regular Production
|
None Regular Production
|
None Of Them
|
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
|
In A Stack
|
The Element Pushed First Is Poped First
|
The Element Pushed First Is Poped In The Last
|
The Element Pushed In Last Is Poped In Last
|
None Of Given Options
|
B
|