|
CS402
|
Fa Corresponding To An Nfa Can Be Built By Introducing A State Corresponding To The Combination Of States For A Letter Having Choices
|
No Transition At Certain State
|
One Transition At Certain State
|
More Than One Transitions At Certain State
|
None Of The Given Options
|
C
|
|
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
|
The Symbols That Must Be Replaced By Other Things Are Called __________
|
Productions
|
Terminals
|
Non-Terminals
|
None Of Given
|
C
|
|
CS402
|
If Every Production In Cfg Is One Of The Following Forms. Conterminal ? Semi Word Nonterminal?Word Then The Language Generated By That Gfc Is
|
Regular
|
Nonregular
|
Finite
|
Infinite
|
A
|
|
CS402
|
A Program Which Is The Set Of Rules Which Show That Which State Is To Be Entered When A Letter Is Read Form The
|
Tape
|
Halt
|
Tm
|
None Of Above
|
A
|
|
CS402
|
Set Of All Palindromes Over {A B}Is Regular
|
True
|
False
|
Na
|
Na
|
B
|
|
CS402
|
The Production Of The Form: Nonterminal-> ^ Is Said To Be Production
|
Null
|
Unit
|
Chomsky Form Production
|
None Of The Given Options
|
A
|
|
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
|
Language Can Be Expressed By More Than One Fa”. This Statement Is
|
True
|
False
|
Some Times True & Sometimes False
|
None Of These
|
A
|
|
CS402
|
The Deviation Of The Word W Generated By A Cfg Such That At Each Step A Production Is Applied To The Left Most Nonterminal In The Working String Is Said To Be
|
Left Most Terminal
|
Left Most Deviation
|
None Of These
|
A B Both
|
B
|
|
CS402
|
If A Language Can Be Expressed Through Fa Then It Can Also Be Expressed Through Tg
|
True
|
False
|
Depends On Language
|
None Of The Above
|
A
|
|
CS402
|
A Dfa With N States Must Accept At Least One String Of Length Greater Than N
|
True
|
False
|
Na
|
Na
|
|
|
CS402
|
There Is At Least One Production That Has One __________ On Its Left Side
|
Terminal
|
Infinite
|
None Terminal
|
All Of Above
|
C
|
|
CS402
|
The Machine Helps In Building A Machine That Can Perform The Addition Of Binary Numbers
|
Incrementing
|
Complementing
|
Decrementing
|
None Of The Given
|
A
|
|
CS402
|
For The Given Input And Box Provides The Boolean And Output
|
True
|
False
|
Na
|
Na
|
A
|
|
CS402
|
If R Is Regular Language And Q Is Any Language (Regular/ Non Regular) Then Pref (Q In R) Is __________
|
Non-Regular
|
Equal
|
Regular
|
Infinite
|
C
|
|
CS402
|
If A Cfg Has Only Productions Of The Form Nonterminal -> String Of Two Nonterminals Or Nonterminal -> One Terminal Then The Cfg Is Said To Be In ___________
|
Pda Form
|
Chomsky Normal Form (Cnf)
|
Null Able Form
|
Unit Production Form
|
B
|
|
CS402
|
Let S = {Aa Bb} Be A Set Of Strings Then S* Will Have
|
?
|
Abba
|
Aabbbaa
|
Bbaab
|
A
|
|
CS402
|
If L1 And L2 Are Regular Languages Is/Are Also Regular Language(S)
|
L1 + L2
|
L1L2
|
L1*
|
All Of Above
|
D
|
|
CS402
|
Any Word Generated By Given Cfg Cannot Also Be Expressed By Syntax Tree Or Generation Tree Or Derivation Tree As Well
|
True
|
False
|
Na
|
Na
|
B
|