Self Doubt : Ambiguity

Question

Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?

Comments

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 .

---

it is regular language and also  ambiguous . but there exist a unambiguous grammar

but doesn't one unambiguous grammar makes the whole language unambiguous?

---

but every regular grammar is either left linear or right linear.

and every right linear grammar and left linear grammar is unambigous.

Answer 1

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