Does ambiguity problem is decidable for regular grammar(right linear grammar)?

Question

Does ambiguity problem is decidable in regular grammar(right linear grammar)?

Comments

https://cstheory.stackexchange.com/questions/19102/ambiguity-in-regular-and-context-free-languages

Answer 1

No.

In case of context free languages ambiguity problem is undecidable. But coming to regular grammar it is decidable.

Comments

Would you like to proof it in a casual way?Because i didn't get any exact explanation.

---

Refer this https://gateoverflow.in/124706/peter-linz-5-1?show=124741#c124741

Read all the comments. it might clear your doubts.

Answer 2

YES, ambiguity of regular is decidable, inface it is trivially decidable. It can be done using product automata or tree method.