S1 b S1 S2 a S2 S2 b S1 S2 c S3 6. A turnstile opens when 20p is inserted. It will accept one 20p coin or two 10p coins. If a customer inserts 10p and then realises they have no more 10p coins, they can press Cancel and their 10p coin is returned. If they insert 20p after already inserting 10p, the turnstile will not open and they must press Cancel and start again. The Finite State Machine below shows this process. Complete the transition table below for this FSM. Original state Input New state S0 10 S0 20 S10 S10 S10 7. Draw the state transition diagram and the equivalent state transition table for a language in which an identifier must start with a letter and be followed by one or more letters or numbers. If the first character input is a number, it reaches a which it can never “dead state” from reach the Accept state. Mark this state with the letter D. Current state Input Next state
S1 b S1 S2 a S2 S2 b S1 S2 c S3 6. A turnstile opens when 20p is inserted. It will accept one 20p coin or two 10p coins. If a customer inserts 10p and then realises they have no more 10p coins, they can press Cancel and their 10p coin is returned. If they insert 20p after already inserting 10p, the turnstile will not open and they must press Cancel and start again. The Finite State Machine below shows this process. Complete the transition table below for this FSM. Original state Input New state S0 10 S0 20 S10 S10 S10 7. Draw the state transition diagram and the equivalent state transition table for a language in which an identifier must start with a letter and be followed by one or more letters or numbers. If the first character input is a number, it reaches a “dead state” from which it can never reach the Accept state. Mark this state with the letter D. Current state Input Next state
Finite%20state%20machines%20Worksheet.docx