s Mailings Review View Zotero > Tell me AaBbCcDdEe Emphasis 1 AaBbC Heading 1 1.1 AaBb( Heading 2 AaBbCcDdF Heading 3 o complete the process, the app needs to restart. Foundations of Computing UFCFFS-30-1 Portfolio Task 2 Due Monday 19-02-2024 Mark /20 In this work, we ask you to design a deterministic Finite Automaton (FA) to recognise arithmetic expressions. When we say arithmetic expression, we mean a kind of expression you can type in a very basic desk calculator. That is, neither variables nor brackets are allowed. It contains only numbers and four arithmetic operators, +, -, *, and /. The following are some examples of arithmetic expression: 1. Any number string with or without signs - e.g. 3, -1, +10, 3.14, -0.70 and 099. 2. Number strings mixed with arithmetic operators - e.g. 3+5, -1+2*3, 7/10-0.7, and -1.4-+8.2. An example of FA diagram for recognising a non-negative integer is given below. You may use it as a start point. You need to add a few more states and transitions to handle numbers with decimal point and signs (e.g. - 5, +2, 0.21, -32.6, +99.05, but not the form 1.0E-3). Most importantly, you also need to add a few more things to deal with the arithmetic operators +, -, *, /. start 0-9 digit 0-9 Note that all above exercises are assessed work. They are worth of 20% of the module mark. Please submit your work to Blackboard by 12:00 Monday 19-02- 2024. Mark will be deducted for late work. ccessibility: Investigate v/nNOTE: Design a deterministic Finite Automation (FA) to recognise arithmetic expressions. Need to provide with a hand drawn design.

Fig: 1