阿摩線上測驗
題組內容
4.Eigen value and matrix diagonization
Afinite state machine (FSM) has two states: state S1 and state S2. Let Prob(S1 →S2) denote the
probability that the machine moves from state S1 to state S2 in a cycle. Assume that the state
transition probabilities are fixed in every cycle: Prob(S1→S1)=0.3, Prob(S1→＞S2)-0.7,
Prob(S2→S1)=0.6, Prob(S2→S2)=0.4. Initially, the FSM is in state S1 at cycle 0.
Afinite state machine (FSM) has two states: state S1 and state S2. Let Prob(S1 →S2) denote the
probability that the machine moves from state S1 to state S2 in a cycle. Assume that the state
transition probabilities are fixed in every cycle: Prob(S1→S1)=0.3, Prob(S1→＞S2)-0.7,
Prob(S2→S1)=0.6, Prob(S2→S2)=0.4. Initially, the FSM is in state S1 at cycle 0.