|
CS402
|
In Which Of The Following Language Rev(S)=S
|
Equal
|
Integer
|
Palindrome
|
Factorial
|
C
|
|
CS402
|
(A+B)*A(A+B)*B(A+B)* Is The Re Of Language Defined Over S={A B} Having At Least One A And One B
|
True
|
False
|
Such A Language Does Not Exist
|
None Of The Given Options
|
A
|
|
CS402
|
Formal’ In Formal Languages Means
|
The Symbols Used Have Well Defined Meaning
|
They Are Unnecessary In Reality
|
Only The Form Of The String Of Symbols Is Significant
|
None Of These
|
A
|
|
CS402
|
Consider The Following Gfc : S?Aa|Bb A?Aa|B B?As|? Here S?Aaand A?B Are Null Productions While B?? Is Null Able Production
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
Like Tg A Pda Can Also Be Non-Deterministic
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
Choose The Correct Statement
|
A Mealy Machine Generates No Language As Such
|
A Moore Machine Generates No Language As Such
|
A Mealy Machine Has No Terminal State
|
All Of These
|
C
|
|
CS402
|
Bottem Up Parsing Can Be Determined Similar To That Of Top Down Parsing With The Change That In This Case The Process Is Started With The Given String And The Tree Is Extended Till “S “Is
|
Regular
|
Non Regular
|
Obtain
|
Finite
|
C
|
|
CS402
|
For A Certain Language L The Complement Of Lc Is The Given Language L I.E. (L^C)^C = L
|
True
|
False
|
Na
|
Na
|
T
|
|
CS402
|
If An Fa Has N State Then It Must Accept The Word Of Length
|
N2
|
N-1
|
N+1
|
All Of Above
|
C
|
|
CS402
|
The Structure Given Below Is Called ___________ S -> Aa|Bb A -> As|A B -> Bs|B
|
Re
|
Tg
|
Cfg
|
Pda
|
C
|
|
CS402
|
Then The Language Generated By That Cfg Is
|
Non Regular
|
Infinite
|
Regular
|
Finite
|
C
|
|
CS402
|
Language
|
Must Be Finite
|
Must Be Infinite
|
Can Be Finite Or Infinite
|
Must Be Finite And Cannot Be Infinite
|
B
|
|
CS402
|
If R1 = (Aa + Bb) And R2 = ( A + B) Then The Language (Aa + Bb)* Will Be Generated By
|
(R1)(R2)
|
(R1 + R2)
|
(R2)*
|
(R1)*
|
B
|
|
CS402
|
If A Language Is Expressed Through Tg Then That Language Will Have Its Re
|
True
|
False
|
Depends On Language
|
None Of These
|
A
|
|
CS402
|
The Clouser Fa*(Star On An Fa ) Always Accept String
|
Null
|
Aa
|
Bb
|
None Of Given
|
A
|
|
CS402
|
The Language That Can Be Expressed By Any Regular Expression Is Called A Non Regular Language
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
A Production In Cfg Consists Of
|
One Terminal
|
More Than One Terminal
|
One Non-Terminal
|
Terminals And Non-Terminals
|
D
|
|
CS402
|
Above Given Fa Accepts The Language In Which Strings
|
Begins With And Ends In Same Letter
|
Begins With And Ends In Different Letter
|
Has Length More Than 2
|
None Of The Given
|
A
|
|
CS402
|
Does The Empty String Match The Regular Expression |Y+A|?
|
True
|
False
|
Some Times True & Sometimes False
|
None Of Given
|
B
|
|
CS402
|
In Fa One Enter In Specific Stat But There Is No Way To Leave It Then State Is Called
|
Dead States
|
Waste Baskets
|
Davey John Lockers
|
All Of Above
|
D
|