3 votes 3 votes Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example? Theory of Computation theory-of-computation finite-automata ambiguous regular-language context-free-language context + – logan1x asked May 10, 2019 logan1x 1.1k views answer comment Share Follow See all 14 Comments See all 14 14 Comments reply Show 11 previous comments abhishekmehta4u commented Jul 18, 2019 reply Follow Share if you have a regular language then there must exist a unambiguas grammar . so we can say ambiguity problem of regular language is decidable. example S---> aS/Sa/a it is regular language and also ambiguous . but there exist a unambiguous grammar S-->as/a . 0 votes 0 votes logan1x commented Jul 21, 2019 reply Follow Share it is regular language and also ambiguous . but there exist a unambiguous grammar but doesn't one unambiguous grammar makes the whole language unambiguous? 0 votes 0 votes Spidey_guy commented Dec 31, 2019 reply Follow Share but every regular grammar is either left linear or right linear. and every right linear grammar and left linear grammar is unambigous. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes There is no inherent ambiguity in regular languages. Every regular language is convertible to an NFA. An NFA is convertible to a DFA. A DFA is conertible to a minimal DFA. The minimal DFA is unique. https://cs.stackexchange.com/questions/63171/how-to-prove-that-minimal-dfa-is-unique Joey answered Jan 3, 2021 Joey comment Share Follow See all 0 reply Please log in or register to add a comment.