1 votes 1 votes In converting right linear regular grammar to DFA how to determine the final states? Can anyone tell the procedure? Theory of Computation theory-of-computation finite-automata regular-grammar + – sushmita asked Sep 16, 2018 sushmita 678 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Look for the terminal at which grammar ends. Adhish answered Aug 20, 2019 Adhish comment Share Follow See all 0 reply Please log in or register to add a comment.