An ambiguous Language is a formal language for which there exists a string that can have more than one meaning (several possible meanings or interpretations). Multiple synthesis structures for a string.
Are Roman numbers an example of an ambiguous language?
Because there can be more then one representation for some number such as 1999, which
can be written as
I am confused. Sometimes I feel not, some time yes!
Although there can be more than one representation of same magnitude in Roman Number System. That is basically Non-Positional Number System. But its possible to write Unambiguous Grammar for that can generate all possible/valid pattern in Roman Number System.
Here is again a beautiful link that describe
Grammar for Roman number.
I am not sure about this but some authors says that: "Roman numbers can be recognized by a regular expression, so you don't really need a context-free grammar." and a regular language can't be ambiguous.