Finite State Machines

You can use http://automatonsimulator.com as FSM simulator

FSM From a Grammar For each of the grammars below, state what language the grammar describes. Then create a deterministic FSM without output that recognizes the language. Test the FSM with at least three (if possible) strings that should be accepted and three that should be rejected. For each machine, turn in a single screenshot showing your machine, the testing text boxes, and the results that appear at the bottom of the screen. The screen on the bottom should be all green when you test your machine. 1. G (V,T,S,P), where V 0, 1,S,A,B), T 0, 1), S is the start symbol, and the set of 2. G-(V.T,S,P), where V -0, 1,S,A,B, T 0, 1), S is the start symbol, and the set of 3. G = (V,T,S,P), where V ={0, S,A.B), T = {0, 1), s is the start symbol, ard the set of productions is { S 0A. S 1B. A-> 0, B 0) productions is { S 1A, S 0, S X, A 0B. B 1B. B 1) productions is {S 1B, S 0A, A 1A, A0B, A 1, A0, B 1}