🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Regular Grammars and Finite Automata: all 10 questions

Quiz: Regular Grammars and Finite Automata · Question 6 of 10

Why can the automaton built from a right-linear grammar be an NFA rather than a DFA?

Why can the automaton built from a right-linear grammar be an NFA rather than a DFA?

  1. A.Grammars always have ε-moves
  2. B.A variable can have two rules with the same terminal, like A → bA | b
  3. C.The grammar has no start symbol
  4. D.Right-linear grammars generate non-regular languages
Answer & explanation

Correct answer: A variable can have two rules with the same terminal, like A → bA | b

Two rules with the same terminal give two arrows with the same label from one state.

Can you get the rest right without peeking?

Take the timed Quiz: Regular Grammars and Finite Automata quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →