|
CS402
|
Cfg Is Said To Be A Regular Grammar If It Generates The Regular Language I.E.A Cfg Is Said To Be A Regular Grammar In Which Each Production Is One Of The:
|
Three Forms
|
One Form
|
Four Forms
|
Two Forms
|
D
|
|
CS402
|
L= Language Of Words Containing Even Number Of A’S. Regular Expression Is
|
(A+B)*Aa(A+B)*
|
(B+Ab*A)*
|
A+Bb*Aab*A
|
(A+B)*Ab(A+B)*
|
B
|
|
CS402
|
Using Tree Structure Final State Represent By
|
*
|
-
|
Double Circle
|
None Of Given
|
C
|
|
CS402
|
What Do Automata Mean?
|
Something Done Manually
|
Something Done Automatically
|
Both Of These
|
None Of These
|
B
|
|
CS402
|
Let Q = {Aa Abaaabb Bbaaaaa Bbbbbbbbbb} And R = {B Bbbb Bbbaaa Bbbaaaaa} Pref (Q In R) Is Equal To
|
{B Bbba Bbbaaa}
|
{B Bba Bbaaa}
|
{Ab Bba Bbbaa}
|
{B Bba Bbba}
|
A
|
|
CS402
|
Examin The Following Cfg And Select The Correct Choice:
S? Ab A ?Bsb B? Cc C? Ss A? A|B C? B|Bb
|
Abb Is A Word In The Corresponding Cfl
|
Abb Is Not The Word Of Corresponding Cfl
|
Any Word Can Be Accept From The Corresponding Cfl
|
Non Of These
|
A
|
|
CS402
|
Symbols That Can’T Be Replaced By Anything Are Called__________
|
Terminal
|
Non-Terminal
|
Production
|
All Of Given
|
A
|
|
CS402
|
In Cfg The Symbols That Cannot Be Replaced By Anything Are Called __________
|
None Terminals
|
Infinite
|
Finite
|
Terminals
|
D
|
|
CS402
|
The Language Generated By __________ Is Called Context Free Language (Cfl).
|
Fa
|
Tg
|
Cfg
|
Tgt
|
C
|
|
CS402
|
Who Did Not Invent The Turing Machine?
|
Alan Turing
|
A. M. Turing
|
Turing
|
None Of These
|
B
|
|
CS402
|
Let Fa 3 Be An Fa Accepting L1nL2 Then The Initial Stat Of Fa3 Must Be Correspond To The Initial State Of__________ And Initial State Of__________
|
Fa3 Fa2
|
Fa1 Fa2
|
Fa1 Fa3
|
None Of The Given
|
B
|
|
CS402
|
S = {Baa Ab} Then S* Will Not Contain
|
Abbaab
|
Abab
|
Baabaa
|
Abbaa
|
A
|
|
CS402
|
If L1 And L2 Are Expressed By Regular Expressions R1 And R2 Respectively Then The Language Expressed By R1 + R2 Will Be ___________
|
Regular
|
Ir-Regular
|
Can’T Be Decided
|
Another Language Which Is Not Listed Here
|
A
|
|
CS402
|
The Grammatical Rules Are Often Called__________
|
Productions
|
Terminals
|
Non-Terminals
|
None Of Given
|
A
|
|
CS402
|
If A Language Can Be Expressed By A Regular Expression Then Its Complement Cannot Be Expressed By A Regular Expression. This Statement Is
|
True
|
False
|
Depends On Language
|
None Of The Given Optios
|
B
|
|
CS402
|
Identify The True Statement
|
A Pda Is Non-Deterministic If There Are More Than One Read States In Pda
|
A Pda Is Never Non-Deterministic
|
Like Tg A Pda Can Also Be Non-Deterministic
|
A Pda Is Non-Deterministic If There Are More Than One Reject States In Pda
|
C
|
|
CS402
|
Can A Turing Machines Head Ever Be In The Same Location In Two Successive Steps?
|
True
|
False
|
True But Only In Finite Languages
|
True But Only In Infinite Langauges
|
B
|
|
CS402
|
Every Regular Expression Can Be Expressed As Cfg But Every Cfg Cannot Be Expressed As A Regular Expression. This Statement Is:
|
True
|
False
|
Depends On The Language
|
None Of The Given Options
|
A
|
|
CS402
|
A(A+B)*A+B(A+B)*B Is Re For The Language Defined Over S={A B} Having Words Beginning And Ending With Same Letters
|
True
|
False
|
Such A Language Is Not Regular
|
None Of These
|
A
|
|
CS402
|
The Regular Expression Thus Obtained If Contains At Least One Word Then The Language Is Not Empty Otherwise The Language Is__________
|
Regular
|
No Regular
|
Empty
|
Non Of The Above
|
C
|