|
CS402
|
Before The Cfg Corresponding To The Given Pda Is Determined The Pda Is Converted In To The Standard Form Which Is Called The
|
Standard Form
|
Conversion Form
|
Left Most Derivation
|
None Of Them
|
B
|
|
CS402
|
Consider The Language L Of Strings Defined Over S = {A B} Ending In A
|
There Are Finite Many Classes Generated By L So L Is Regular
|
There Are Infinite Many Classes Generated By L So L Is Regular
|
There Are Finite Many Classes Generated By L So L Is Non-Regular
|
There Are Infinite Many Classes Generated By L So L Is Non-Regular
|
B
|
|
CS402
|
Palindrome Can Be Defined By More Than One Regular Language
|
True
|
False
|
By Only One Re
|
Some Times By Only One Re And Some Times False
|
B
|
|
CS402
|
Any Language That Can Not Be Expressed By A Re Is Said To Be Regular Language
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
If L1 And L2 Are Regular Languages Is/Are Also Regular Language(S)
|
L1 + L2
|
L1L2
|
L1*
|
All Of Above
|
D
|
|
CS402
|
The Production Of The Form Nonterminal ?? Is Said To Be Null Production
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
If W Is Large Enough Word In A Cf Then W Can Be Decomposed Into W =Uvwxyz Such That All Words Of The Form Uvn Xynz Belong To
|
Cnf
|
L
|
Cfl
|
Cfg
|
B
|
|
CS402
|
Fa1 Corresponds To R* Then Fa1 Must Accept __________ String
|
Every
|
Null
|
Odd Length
|
Even Length
|
A
|
|
CS402
|
Choose The Incorrect Statement
|
(A+B)*Aa(A+B)* Generates Regular Language
|
A Language Consisting Of All Strings Over ?={A B} Having Equal Number Of A’S And B’S Is A Regular Language
|
Every Language That Can Be Expressed By Fa Can Also Be Expressed By Re
|
None Of These
|
D
|
|
CS402
|
In Fa If One Enters In A Specific State But There Is No Way To Leave It Then That Specific State Is Called
|
Dead States
|
Waste Baskets
|
Davey John Lockers
|
All Of These
|
D
|
|
CS402
|
In Pumping Lemma Theorem (X Y^N Z) The Range Of N Is
|
N=1 2 3 4……….
|
N=0 1 2 3 4……….
|
N=…….-3 -2 -1 0 1 2 3 4……
|
N=…….-3 -2 -1 1 2 3 4……
|
A
|
|
CS402
|
If Two Languages R And Q Are Given Then The Prefixes Of Q In R Denoted By Pref(Q In R)
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
If F Accept An ………….. Language Then There Are Some Words W.S.T N= Length (W) <2N
|
Regular
|
Finite
|
Infinite
|
None Of Given
|
C
|
|
CS402
|
If L1 And L2 Are Two Regular Languages Then L1 U L2 Is Not A Regular
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
Tg Is Always Deterministic
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
There Is An Approach In Defining The Quotient Of Regular Languages Ie The Language Q Is Said To Be Quotient Of Two Regular Languages P And R Denoted By Q=R/P If
|
Pq=R
|
R=Pq
|
Qr=P
|
Non Of Above
|
A
|
|
CS402
|
S = {A B} Productions S?Xaax X?Ax X?Bx X??. This Grammar Defines The Language Expressed By__________
|
(A+B)*Aa(A+B)*
|
(A+B)*A(A+B)*A
|
(A+B)*Aa(A+B)*Aa
|
(A+B)*Aba+B)*
|
A
|
|
CS402
|
For A Non Regular Language There Exist __________ Fa
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
If Two Strings X And Y Defined Over S Are Run Over An Fa Accepting The Language L Then X And Y Are Said To Belong To The Same Class If They End In The Same State No Matter That State Is Final Or Not
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
The Process Of Finding The Derivation Of Word Generated By Particular Grammar Is Called
|
Plus Timing
|
Parsing
|
Halt
|
All Of Above
|
B
|