0 votes 0 votes Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous? Theory of Computation theory-of-computation finite-automata ambiguous + – OneZero asked Dec 7, 2018 OneZero 578 views answer comment Share Follow See 1 comment See all 1 1 comment reply Joey commented Jan 3, 2021 reply Follow Share I think only the Regular grammar obtained from a minimal DFA is unambiguous. 0 votes 0 votes Please log in or register to add a comment.