Transition of finite automata is ___________
(a) Finite Diagram
(b) State Diagram
(c) Node Diagram
(d) E-R Diagram
The question was asked during an online exam.
This is a very interesting question from Right Left Linear Grammar in section Contextfree Grammar and Syntax Analysis of Compiler