Paper Tayyari

Lecture 8: Transition Graph

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

6 MCQs · 1 short · 1 long question · 6 MCQs from past papers6 MCQs · 1 short · 1 long sawal · 6 MCQs past papers se

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

In TG there may exist more than one path for certain string.

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

A TG may be nondeterministic, so a string can have several paths.

2.
★ Midterm Spring 2010

In TG there may exist no paths for certain string.

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

A TG need not have an edge for every letter, so some strings have no path.

3.
★ Midterm Fall 2010

TG can more then one initial state

  1. ATrue
  2. BFalse
  3. CDepend on alphabets
  4. DNone of given

A TG may have several start states.

4.
★ Midterm Fall 2010

TG is always deterministic.

  1. ATrue
  2. BFalse

A TG may have several or no paths for a string, so it can be nondeterministic.

5.
★ Midterm Spring 2009

In TG, there may be a transition for null string.

  1. ATrue
  2. BFalse
  3. CCan't show transition for string
  4. DNone of these

TG edges may be labelled with Λ.

6.
★ Midterm Spring 2009

TG can have more than one initial state.

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

A TG may have several start states.