Reply
Sun 12 Feb, 2017 06:14 am
how to make a DFA for this problem : Suppose we have a programming language that accepts double values of the following formats:
• An optional plus or minus followed by sequence of at least one digit followed by dot followed by a
sequence of at least one digit, e.g., +0.343 or -99.332 or 100.233
• A dot followed by at least one digit e.g., .343 or -.33 or +.2 or .1 or
• The above formats followed by e (to specify the power of 10) followed by an optional negative or
positive power of 10 e.g., 9.33e22 or 0.23e33 or -.873e2 or +2.11e-23
Make an NFA, NFA-NULL or DFA to represent the set of real numbers