Theory of computation_Quiz_2

what will be output of a+

• a.aa.aaa...

• e,a,aa,aaa..

• none

pumping lemma is used to prove

• language is regular

• language not regular

• none

which of the following will contain epsilon in output

• 0*

• 0+

• both

Arden method is used to convert

• re to cfg

• cfg to re

• DFA to RE

• both a and b

which of the following finite automata generates output

• NFA

• DFA

• Mealy machine

• Moore Machine

What is the type of the following grammar A-->BC

• Unrestricted grammar

• Regular Grammar

• Context Free Grammar

• None

The grammar which generates more than one type of derivation for the same string is

• Ambiguous Grammar

• Context free grammar

• Regular Grammar

• None

What will be the output when null production is eliminated for the following grammar

S-->aA|epsilon

• S-->a

• S-->aA|a

• S-->aA

• none

Which of the following is unit production

• S-->A

• A-->B

• S-->aS

• both a and b

Which of the following grammar is in chomsky normal form

• S-->aB

• S-->AB

• A-->SDa

• S-->a