Paper Tayyari

Lecture 5: Finite Automaton

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

4 MCQs · 5 short questions · 4 MCQs from past papers4 MCQs · 5 short sawal · 4 MCQs past papers se

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

One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the diagram

  1. A4
  2. B5
  3. C7
  4. D6

Each of the 3 states needs one transition for each of the 2 letters: 3 × 2 = 6.

2.
★ Midterm Spring 2010

Every FA should be __________

  1. ADeterministic
  2. BNon- Deterministic
  3. CDeterministic & Non- Deterministic
  4. DNone of these

An FA has exactly one transition per letter from each state.

3.
★ Midterm Fall 2010

In FA final state represent by _________sign

  1. A+
  2. B-
  3. C=
  4. D*

Final states are marked + and the initial state -.

4.
★ Midterm Spring 2009

One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the diagram.

  1. A(n)+(m)
  2. B(m)(n) OR (n)(m)
  3. CNone of the given options
  4. D(m)-(n)

Each of the n states has one transition for each of the m letters.