← Quiz: Regular Grammars and Finite Automata: all 10 questions
Quiz: Regular Grammars and Finite Automata · Question 2 of 10
When converting a DFA to a right-linear grammar, what does the arrow P --1-- Q become?
When converting a DFA to a right-linear grammar, what does the arrow P --1--> Q become?
- A.P → 1Q
- B.Q → 1P
- C.P → Q1
- D.P → 1
Answer & explanation
Correct answer: P → 1Q
Each arrow becomes a rule from the source state's variable: read 1, then continue as Q.
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 →