|
CS402
|
A Operator Adds A New Letter At The Top Of Stack
|
Push
|
Pop
|
Read
|
Append
|
A
|
|
CS402
|
The Cfg Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The ………… Production Trees
|
One
|
Two
|
More Than One
|
At Most One
|
C
|
|
CS402
|
Let L Be A Language Defined Over An Alphabet S Then The Language Of Strings Defined Over S Not Belonging To L Is Called Complement Of The Language L Denoted By Lc Or L’
|
True
|
False
|
Na
|
Na
|
T
|
|
CS402
|
Left Hand Side Of A Production In Cfg Consists Of:
|
One Terminal
|
More Than One Terminal
|
One Non-Terminal
|
Terminals And Non-Terminals
|
D
|
|
CS402
|
The Language Generated By The Cfg Is Called The Language ___________ By The Cfg
|
Produced
|
Null String
|
Pumping Lemma
|
Non Of Then
|
A
|
|
CS402
|
In New Format Of An Fa This State Is Like Dead-End Non Final State
|
Accept
|
Reject
|
Statr
|
Read
|
B
|
|
CS402
|
The Length Of Output String In Case Of ___________ Is One More Than The Length Of Corresponding Input String
|
Finite Automaton
|
Tg
|
Gtg
|
None Of These
|
A
|
|
CS402
|
Cfg Stands For ___________
|
Context Free Graph
|
Context Free Grammar
|
Context Finite Graph
|
Context Finite Grammar
|
B
|
|
CS402
|
Languages Generated By Kleene Star Are Always __________
|
Finite
|
Infinite
|
Sometimes Finite & Sometimes Infinite
|
None Of The These
|
B
|
|
CS402
|
S={A Bb Bab Baabb} Set Of Strings Then S* Will Not Have
|
Baba
|
Baabbab
|
Bbaaabb
|
Bbbaabaabb
|
A
|
|
CS402
|
Language Which Are Context –Free Are Called Non –Cfl
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
“One Language Can Be Expressed By More Than One Fa”. This Statement Is __________
|
True
|
False
|
Some Times True & Sometimes False
|
None Of These
|
A
|
|
CS402
|
Which Statement Is True?
|
All Words Are Strings
|
All Strings Are Words
|
Both Are Always Same
|
None Of These
|
A
|
|
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
|
Fa1 And Fa2 Are Two Fa’S Representing Two Languages. Then Fa3 Which Is Sum Of Fa1 And Fa2 Will Accept The Strings Which Are
|
Accepted By Fa1 And Fa2
|
Accepted By Fa1 Or Fa2
|
Accepted By Fa1 And/Or Fa2
|
None Of The Given Options
|
C
|
|
CS402
|
Fa3 Expresses R1R2. Then There Will Be At Least One Final State Of Fa3 That Consist Of Final State Of Fa1 And Initial State Of Fa2
|
True
|
False
|
Depends On Language
|
None Of These
|
B
|
|
CS402
|
In Fa Final State Represent By ___________Sign
|
+
|
-
|
=
|
*
|
A
|
|
CS402
|
(A* + B*)* = (A + B)* This Expression Is __________
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
Formal Is Also Known As ___________
|
Syntactic Language
|
Semantic Language
|
Informal Language
|
None Of These
|
A
|
|
CS402
|
The Langue Generated By Cfg Is Called Context Free Language (Cfl)
|
True
|
False
|
Na
|
Na
|
A
|