Question: 7. Construct a DFA that takes strings over {X, V, I} as input, and that accepts if and only if the input is a valid

7. Construct a DFA that takes strings over {X, V, I} as input, and that accepts if and only if the input is a valid Roman numeral. A string is a valid Roman numeral if and only if it is non-empty and has the following form: A sequence of 0 to 3 "X" Followed by one of "IX" or "IV" or 0 or 1 "V"s followed by 0 to 3 "I's For example, "XIV" is a valid Roman numeral because it begins with 1 "X" (rule 1), followed by "IV" (rule 2.2). "XXI" is valid because it consists of 2 "Xs" (rule 1) followed by 0 "Vs" and 1 "I" (rule 2.3). "XVX" is not valid, because nothing in the above rules allows a "V" to be followed by an "X
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
