|
CS402
|
Fa3 Expresses R1R2. Then Initial State Of Fa3 Will Consist Of
|
Initial State Of Fa2
|
Initial State Of Fa1
|
Initial States Of Both Fa1 & Fa2
|
Depends On Fa’S
|
B
|
|
CS402
|
Languages Are Proved To Be Regular Or Non Regular Using Pumping Lemma
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
Consider The Following Cfg: (Note: ^ Means Null) S->A|Xb|Aya X->Y|^ Y->B|X Which Nonterminal(S) Is/Are Not Nullable
|
S
|
X
|
Y
|
S X And Y
|
B
|
|
CS402
|
The Production Of The Form Nonterminal ?String Of Two Nonterminals Is Called A
|
Live Production
|
Dead Production
|
Type Of Production
|
None Of Them
|
A
|
|
CS402
|
A Regular Language
|
Must Be Finite
|
Must Be Infinite
|
Can Be Finite Or Infinite
|
Must Be Finite And Cannot Be Infinite
|
A
|
|
CS402
|
The Major Problem In The Earliest Computers Was
|
To Store The Contents In The Registers
|
To Display Mathematical Formulae
|
To Load The Contents From The Registers
|
To Calculate The Mathematical Formula
|
B
|
|
CS402
|
If R Is A Regular Language And L Is Some Language And L U R Is A Regular Language Then L Must Be A Regular Language
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
Which Of The Following Is A Regular Language?
|
String Of Odd Number Of Zeroes
|
Set Of All Palindromes Made Up Of 0’S And 1’S
|
String Of 0’S Whose Length Is A Prime Number
|
All Of These
|
C
|
|
CS402
|
Consider The Following Cfg: S?As|Bs|Aas|? Can Be Observed That The Word Aaa Can Be Derived From More Than
|
One Production Tree
|
Two Producton Tree
|
Total Language Tree
|
All Of Above
|
A
|
|
CS402
|
(A* + B*)* = (A + B)* This Expression Is __________
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
Tg Can More Then One Initial State
|
True
|
False
|
Depend On Alphabets
|
None Of Given
|
A
|
|
CS402
|
The Reverse Of The String Sbfsbb Over { Sb F B}
|
(Bsbfsb)
|
Bfsbs
|
Sbbfsb
|
Bbfsb
|
A
|
|
CS402
|
In Tg There May Exist No Paths For Certain String
|
True
|
False
|
Depends On The Language
|
None Of These
|
A
|
|
CS402
|
Which Of The Following Is Not A Regular Language?
|
String Of 0’S Whose Length Is A Perfect Squere
|
Set Of All Palindromes Made Up Of 0’S And 1’S
|
String Of 0’S Whose Length Is A Prime Number
|
All Of The Given Options
|
B
|
|
CS402
|
The Complement Of A Regular Language Is Also A Regular
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
Left Hand Side Of A Production In Cfg Consists Of
|
One Terminal
|
More Than One Terminal
|
One Non-Terminal
|
Terminals And Non-Terminals
|
D
|
|
CS402
|
If L Is A Regular Language Then Lc Is Also A Language
|
Regular
|
Non-Regular
|
Regular But Finite
|
None Of The Given
|
A
|
|
CS402
|
The Locations Into Which We Put The Input Letters On Input Tap Are Called
|
Words
|
Alphabets
|
Cells
|
Elements
|
C
|
|
CS402
|
If The Intersection Of Two Regular Languages Is Regular Then The Complement Of The Intersection Of These Two Languages Is Also Regular:
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
The Production S --> Ss | A | B | ^ Can Be Expressed By Re
|
(A+B)+
|
(A+B)
|
(A+B)*
|
(Ab)*
|
C
|