Deterministic Finite Automata of a simple arithmetic string

Asked Aug 21 '13 at 06:48

Active Aug 21 '13 at 06:48

Viewed 491 times

Would this DFA solve the problem to create a DFA that accepts simple arithmetic string.

e.g.

7        -> accepted
4+1      -> accepted
5-7      -> accepted
8*3      -> accepted
2/1      -> accepted

*        -> not accepted
/3       -> not accepted
5+       -> not accepted

I am thinking if I would want to accept negative numbers but this is not required, so I created this DFA

DFA

asked Aug 21 '13 at 06:48

Joey Hipolito

3,108
11
44
83

What do you mean by "simple arithmetic string"? Is 4 + 3 + 2 a "simple arithmetic string"? Do you allow parenthesis? Please give a precise definition. – J.-E. Pin Aug 24 '13 at 08:44
stat your "simple arithmetic string"? – Grijesh Chauhan Aug 24 '13 at 14:43
wah, forgot the start...thank yo for pointing out.. – Joey Hipolito Sep 23 '13 at 11:38

Deterministic Finite Automata of a simple arithmetic string

0 Answers0