Consider a specification for numerical constants which conform to the following restrictions:

1.at least one digit precedes the decimal point
2. the decimal point is optional, but if present is followed by at least one digit
3. Except as demanded by (1) and (2) leading and trailing zero digits are not permitted.

Assuing D is any digit between 1 and 9, e.g.,
D = ( 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 )

(a) Write a regular expression to describe these strings.

(b) Show this regular expression as a deterministic finite state machine. Be sure to indicate the state state and all accepting states.


This is one of my hw question, and I am just stuck for days, any help would be appreciated.

Thank You.

The forum rules says:

Do not expect LQ members to do your homework - you will learn much more by doing it yourself.

But you're lucky I'm in good mood, so here's my suggestion:

oh, I didn't see that rule, sorry.

Thanks for your help.