In TG there may exist more than one path for certain string.
- ATrue
- BFalse
- CDepends on the language
- DNone of these
A TG may be nondeterministic, so a string can have several paths.
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
In TG there may exist more than one path for certain string.
A TG may be nondeterministic, so a string can have several paths.
In TG there may exist no paths for certain string.
A TG need not have an edge for every letter, so some strings have no path.
TG can more then one initial state
A TG may have several start states.
TG is always deterministic.
A TG may have several or no paths for a string, so it can be nondeterministic.
In TG, there may be a transition for null string.
TG edges may be labelled with Λ.
TG can have more than one initial state.
A TG may have several start states.
No MCQs match this filter.Is filter mein koi MCQ nahi.
Can you say that for a certain string there may be more than one paths in a TG?
Yes. A TG is nondeterministic, so a string may have more than one path (or none); it is accepted if at least one path ends in a final state.
Draw TGs: accepting all strings, accepting none, starting with b, not ending in b, containing aa, containing aa or bb
Over {a, b}: all strings: one state that is both initial and final with a loop a, b. None: an initial state with a loop a, b and no final state. Starting with b: initial state 1 --b--> final state 2 with loop a, b at 2. Not ending in b: start state 1 with loop a, b and an edge a from 1 to final state 2, plus a second start state that is also final (to accept Λ). Containing aa: 1 (loop a, b) --aa--> 2+ (loop a, b). Containing aa or bb: 1 (loop a, b) with edges aa and bb to final state 2 (loop a, b).