Theory of computation regarding FA and Regular expression
I have a question i am stuck on, any help would be great
A water bottles vending machine accepts only (50p and £1), when a total input reaches £1, the machine releases a water bottle, if the total exceeds £1, the machine does not return change:
a) Construct a state diagram of FA recognise the above scenario and list the alphabet:
b) Give Regular Expression that can generating the above scenario:
Posted Nov 20, 2023, 10:23 PM UTC
11
Your post to r/AskComputerScience has been removed because it appears to be about technical support or computer help, which is considered off-topic here. This subreddit is for questions about academic computer science, as it would be taught at a university. See our rules for details. Your question may be more on-topic in r/techsupport.
This action was performed automatically by AskCSBot. If you believe this is in error, please message the mods.