← Quiz: Regular Grammars and Finite Automata: all 10 questions
Quiz: Regular Grammars and Finite Automata · Question 5 of 10
When converting a right-linear grammar to an NFA, what does the rule A → b become?
When converting a right-linear grammar to an NFA, what does the rule A → b become?
- A.A becomes an accepting state
- B.A self-loop on A labelled b
- C.An arrow A --b--> F, where F is a new final state
- D.It is deleted
Answer & explanation
Correct answer: An arrow A --b--> F, where F is a new final state
The rule ends the derivation after reading b, so it leads to a final 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 →