|
CS402
|
In Gtg If A State Has More Than One Incoming Transitions From A State. Then All Those Incoming Transitions Can Be Reduced To One Transition Using __________ Sign
|
-
|
+
|
*
|
None Of The Given
|
B
|
|
CS402
|
The Moment A Final State Of ___________ Fa Is Entered The Possibility Of The Initial State Of __________ Fa Will Be Included As Well
|
First Third
|
First Second
|
Second Third
|
All Of Above
|
B
|
|
CS402
|
In Drawing Fa3 (Which Is Equal To Fa1 + Fa2) A State Will Be Declared Final If
|
States Of Both Fa’S Are Final
|
At Least One State Is Final
|
Depends On Language
|
None Of The Given
|
B
|
|
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
|
A Production Is Called Null Able Production If It Is Of The Form N ? ?
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
__________Is A Place Where The Input Letters Can Be Placed Until These Letters Are Referred Again. It Can Store As Many Letters As One Can In A Long Column
|
Stack
|
Pop And Stack
|
Pushdown Stack
|
None Of These
|
C
|
|
CS402
|
If An Effectively Solvable Problem Has Answered In Yes Or No Then This Solution Is Called __________
|
Decision Problem
|
Decision Method
|
Decision Procedure
|
Decision Making
|
C
|
|
CS402
|
Myhill Nerode Theorem Is Consisting Of The Followings
|
L Partitions S* Into Distinct Classes
|
If L Is Regular Then L Generates Finite Number Of Classesif L Is Regular Then L Generates Finite Number Of Classes
|
If L Generates Finite Number Of Classes Then L Is Regular
|
All Of Above
|
D
|
|
CS402
|
Grammatical Rules Which Do Not Involve The Meaning Of Words Are Called __________
|
Semantics
|
Syntactic
|
Both A And B
|
None Of Given
|
B
|
|
CS402
|
The States In Which There Is No Way To Leave After Entry Are Called
|
Davey John Lockers
|
Dead States
|
Waste Baskets
|
All Of The Given Options
|
D
|
|
CS402
|
Left Hand Side Of Cfg May Consist Of
|
One Terminal
|
More Than One Terminal
|
One Non-Terminal
|
Terminals And Non-Terminals
|
C
|
|
CS402
|
If R1 And R2 Are Regular Expressions Then Which Of The Following Is Not Regular Expression
|
R1 = R2
|
R1R2
|
R1*
|
R1 – R2
|
D
|
|
CS402
|
If L Is A Regular Language Then --------- Is Also A Regular Language
|
Lm
|
Ls
|
Lx
|
Lc
|
D
|
|
CS402
|
Pumping Lemma Is Generally Used To Prove That
|
A Given Language Is Infinite
|
A Given Language Is Not Regular
|
Whether Two Given Regular Expressions Of A Regular Language Are Equivalent Or Not
|
None Of These
|
B
|
|
CS402
|
Let L Be Any Infinite Regular Language Defined Over An Alphabet S Then There Exist Three Strings X Y And Z Belonging To S* Such That All The Strings Of The Form Xy Z N For N=1 2 3 … Are The Words In L. Called Complement Of L
|
Pumping Lemma
|
Kleene’S Theorem
|
None Of The Given
|
1 2 Both
|
A
|
|
CS402
|
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
|
D
|
|
CS402
|
The Values Of Input (Say A & B) Does Not Remain Same In One Cycle Due To
|
Tape
|
Halt
|
Clock Pulse
|
Start
|
C
|
|
CS402
|
Converting The Given Cfg In Cnf Is The First Rule Of
|
Cyk Algorithm
|
Cky Algorithm
|
Kyc Algorithm
|
Cnk Algorithm
|
A
|
|
CS402
|
In Tg There May Exist No Paths For Certain String
|
True
|
False
|
Depends On The Language
|
None Of These
|
A
|
|
CS402
|
In Pref(Q In R) Q Is ___________ To (Than) R
|
Q Is Not Equal To R
|
Q Is Equal To R
|
Q Is Infinite
|
None Of Them
|
A
|