Question: Given : Example 1 : An example of application - Soccer-Playing Robot in the slide No 5. The finite automata of the Soccer-Playing Robot Controller
Given : Example 1 : An example of application - Soccer-Playing Robot in the slide No 5. The finite automata of the Soccer-Playing Robot Controller (Example 1) in the slide No 6. Example 2: Formal definition in the slide No 7 9. Design your own simple application @ small robot with AT LEAST 6 states & 10 transition functions as given in the example. Deliverable to the e-learning: A report contains 1) Introduction (about your application /robot) 2) Formal definition (Q, , , q0, F) 3) State diagram 4) Transition table 5) Conclusion Due date: 18th Jan 2021 Example 1 : A Soccer-Playing Robot The FA of Soccer-Playing Robot Controller Example 2: Formal definition of Vending Machine Suppose: All items cost 40 Coins accepted are 5, 10, 20 Recall, formal definition of M = (Q, , , q0, F) What are these entities? Q is a set of states What are the possible states? is the alphabet What are the input symbols? are the transitions How do we move from state to state? q0 is the starting state Where does the machine start from? F is the final state When does the machine stop? Example 2: Formal definition of Vending Machine Q: What are the possible states? The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit : What are the input symbols? The coin denominations : How do we move from state to state? Transition when a coin is deposited q0: Where does the machine start from? The beginning! F is the final state When does the machine stop? Not before you have deposited enough money What if you put in more than 40? Example 2: Formal definition of Vending Machine Q = {q0, , q40} The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit = {5, 10, 20} : How do we move from state to state? Transition when a coin is deposited q0: Where does the machine start from? The beginning! F is the final state When does the machine stop? Not before you have deposited enough money What if you put in more than 40? \ 5 10 20 q0 q5 q10 q20 q5 q10 q15 q25 q10 q15 q20 q30 q15 q20 q25 q35 q20 q25 q30 q40 q25 q30 q35 q40 q30 q35 q40 q40 q35 q40 q40 q40 q40 q40 q40 q40
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
