|
CS402
|
An Fa Has Same Initial And Final State Then It Means That It Has No Final State
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
------------------- Is Obviously Infinite Language
|
Equal-Equal
|
Even-Even
|
Palindrome
|
Factorial
|
C
|
|
CS402
|
It Delays The Transmission Of Signal Along The Wire By One Step (Clock Pulse)
|
Or Box
|
Delay Box
|
Nand Box
|
And Box
|
B
|
|
CS402
|
A (A + B)* Is The Re Of Language Defined Over S = {A B} Having At Least One A
|
True
|
False
|
Such A Language Does Not Exist
|
None Of The Given Options
|
A
|
|
CS402
|
The Unit Production Is
|
Terminal --> Terminal
|
Terminal --> Non Terminal
|
Non Terminal --> Terminal
|
Non Terminal --> Non Terminal
|
B
|
|
CS402
|
The Following Problem(S) ------------- Is/Are Called Decidable Problem(S)
|
The Two Regular Expressions Define The Same Language
|
The Two Fas Are Equivalent
|
Both A And B
|
None Of Given
|
C
|
|
CS402
|
If Fa1 Accepts No String And Fa2 Accepts Many Strings Then Fa1 + Fa2 Will Be Equal To
|
Fa1
|
Fa2
|
May Be Both
|
None Of The Given
|
B
|
|
CS402
|
The Language Generated By That Cfg Is Regular If ___________
|
No Terminal ? Semi Word
|
No Terminal ? Word
|
Both A And B
|
None Of Given
|
C
|
|
CS402
|
He Symbols That Can’T Be Replaced By Anything Are Called__________
|
Productions
|
Terminals
|
Non-Terminals
|
All Of Above
|
B
|
|
CS402
|
A Dfa With N States Must Accept At Least One String Of Length Greater Than N
|
True
|
False
|
Na
|
Na
|
A
|
|
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
|
If L1 And L2 Are Expressed By Regular Expressions R1 And R2 Respectively Then The Language Expressed By R1 + R2 Will Be ___________
|
Ir-Regular
|
Can’T Be Decided
|
Regular Language
|
Another Language Which Is Not Listed Here
|
C
|
|
CS402
|
In Tg There May Exist More Than One Path For Certain String
|
True
|
False
|
Depends On The Language
|
None Of These
|
A
|
|
CS402
|
If An Alphabet Has N Number Of Letter Then Number Of Strings Of Length M Will Be
|
N+M
|
(N)(M)
|
M^N
|
N^M
|
D
|
|
CS402
|
The Part Of An Fa Where The Input String Is Placed Before It Is Run Is Called
|
State
|
Transition
|
Input Tape
|
Output Tape
|
C
|
|
CS402
|
Kleene Star Closure Can Be Defined
|
Over Any Set Of String
|
Over Specific Type Of String
|
Over Any Set Of Language
|
Over Specific Type Of Language
|
A
|
|
CS402
|
The Word ‘Formal’ In Formal Languages Means
|
They Are Unnecessary In Reality
|
Only The Form Of The String Of Symbols Is Significant
|
The Symbols Used Have Well Defined Meaning
|
None Of These
|
C
|
|
CS402
|
A*B* = (Ab)* This Expression Is ___________
|
True
|
False
|
Can’T Be Assumed
|
None Of These
|
B
|