Paper Tayyari

Lecture 9: Generalized Transition Graphs

MCQs, short and long questions from lecture 9.Lecture 9 ki MCQs, short aur long sawal.

4 MCQs · 4 MCQs from past papers4 MCQs · 4 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/4
– correctsahi
1.
★ Midterm Spring 2010

GTG can have _______________ final state.

  1. A0
  2. B1
  3. CMore than 1
  4. DAll of the given

A GTG may have no final state, one, or several.

2.
★ Midterm Spring 2010

In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using _____________ sign

  1. A-
  2. B+
  3. C*
  4. DNone of the given

Parallel edges labelled r1 and r2 become one edge labelled r1 + r2.

3.
★ Midterm Spring 2009

In GTG's there may exist no path for a certain string.

  1. ATrue
  2. BFalse
  3. CDepends on alphabet
  4. DNone of these

Like a TG, a GTG need not have a path for every string.

4.
★ Midterm Spring 2009

GTG can have _____________ initial state.

  1. AZero
  2. BOne
  3. CMore than One
  4. DOne OR more than One

A GTG has at least one start state and may have several.