Finite state Machine A finite state machine (FSM) is either deterministic or non-deterministic. A deterministic FSM (DFSM) is a FSM with at most one transition for each symbol and state. A non-deterministic FSM (NDFSM) is a FSM whose transition function maps inputs symbols and states to a (possibly empty) set of next states. The transition function also may map the null symbol (no input symbol needed) and states to next states. Consider the DFSM M = {I, O, S, d, l, S0) defined by: • Input set I = {1, 0} • Output set O = {} • State set S = {A, B, C, D} • State transition function d • Output function l Suppose that the initial state of the machine M is B and the input sequence is ... click for more
Subject:
Electrical and Computer Engineering
Topic:
Real-Time Systems
Posting ID:
12742
OTA ID:
103877
We are planning to design a new light-voice controlling system. The voices will basically coordinate the crossing of a road by blind people. Suppose the crossing will be operated by two coordinated systems: a light system and a voice system. The light controlling system is an ordinary set of traffic lights intended for vehicles, but with the amber light flashing before the lights change over to green. These lights operate in cycles and display the colors in the order: green, continuous amber, red, flashing amber, green. The set of voices is intended for blind people and makes alternately the voices 'You can cross' and 'Stop'. Making the voice 'You can cross' goes through two phases; a first ... click for more
Subject:
Electrical and Computer Engineering
Topic:
Real-Time Systems
Posting ID:
12949
OTA ID:
104038
Page generated in 0.0107 seconds