1. cs3102: Theory of Computation Class 11: Moore, Mealy, and Markov Models Spring 2010 University of Virginia David Evans

2. Menu Exam Review Variations on DFAs: – Moore Machine: states produce output – Mealy Machine: edges produce output – Markov Model: transitions have probabilities

3. Moore Machine Edward Moore, Gedanken-experiments on Sequential Machines, 1956. http://people.mokk.bme.hu/~kornai/MatNyelv/moore_1956.pdf

5. Moore Machine Example q0; 1 0 q1; 0 1 10

6. “Power” of a Machine Power of a DFA, NFA, DPDA, NPDA/CFG: Set of languages it can recognize/produce. Power of a Moore Machine: Set of functions it can perform. LanguageFunction Set of stringsSet of (input/output) pairs

7. Formal Definition

8. Computing Model DFAMoore

9. Computing Model DFAMoore

10. Moore’s Experiments

12. Okay...guess the machine!

13. You LOSE! q0; 1 0 q1; 0 1 1 0 q2; 0q3; 0 0 1 q6; 1 q5; 0q4; 0 1 1 1 0 0 01 0

14. You always lose.

16. Sometimes “you” win... Lorenz Cipher Machine used by Nazi high command: links between conquered capitals Machine determined by Bill Tutte (1941) from intercepted messages

17. Colossus Bletchley Park, 1943 Bletchley Park, 2004 (rebuilt) Decoded 63 million letters in Nazi command messages Learned German troop locations to plan D-Day (knew the deception was working) Arguably, the first electronic, digital, programmable computer.

18. A More Fair Game Reveal: n, maximum number of states in the machine (and , input alphabet) Equality Rule: two machines are the same if they compute the same function

19.  = {0, 1} n = 3

20. q1; 0 1 q2; 0q3; 1 1 0 0 0

21. How many experiments is enough?

22. Alternate Game Given: state machine Experiment: input -> output Win: guess what state the machine started in Moore proved for some machines where all states are distinguishable, it is impossible to know the starting state from one experiment.

23. Mealy Machine George Mealy, A Method for Synthesizing Sequential Circuits, 1955 q0 0; 1 q1 1; 0 0; 1

24. Computing Model Moore Machine Mealy Machine

25. Computing Model Moore Machine Mealy Machine

26. Which is more powerful? Mealy Moore

27. For any Moore Machine M, we can construct a Mealy Machine M’ that performs the same function: qa; z qi; x qb; y

28. For any Moore Machine M, we can construct a Mealy Machine M’ that performs the same function: qa; z qi; x qb; y qa qi qb x x

31. For any Mealy Machine M, we can construct a Moore Machine M’ that performs the same function: qa qi qb x y

32. For any Mealy Machine M, we can construct a Moore Machine M’ that performs the same function: qa qi qb x y qa qi1; x qb qi2; y Both have all the same outgoing transitions as qi

35. Equally Powerful Mealy Moore (Moore may need more needs more states)

36. Are they good models? q0 0; 1 q1 1; 0 0; 1

37. Markov Model Andrey Markov, 1856-1922 Happy Grumpy Sleepy Sneezy 0.2 0.4 0.1 0.9 0.3 0.7 0.1 1.0

38. Markov Model with Outputs Happy Grumpy Sleepy Sneezy 0.2 0.4 0.1 0.9 0.3 0.7 0.1 1.0 “#%#$&” “ARRGH” 0.7 0.3 “Zzzzzzzz” 1.0 “achoo!” 1.0 “ho ho ho!” “wahoowa!” 0.5

39. Markov Model Examples a.com b.com c.org d.com 1/3 1/2 Nodes: URLs Links: hyperlinks Probabilities: 1/n number of non- self outgoing links Pr(u) = probability of reaching u starting from random seed states

40. Lawrence Page, Sergey Brin, Rajeev Motwani and Terry Winograd

41. Garkov http://www.joshmillard.com/garkov/

42. Hidden Markov Model Happy Grumpy Sleepy Sneezy 0.2 0.4 0.1 0.9 0.3 0.7 0.1 1.0 “#%#$&” “ARRGH” 0.7 0.3 “Zzzzzzzz” 1.0 “achoo!” 1.0 “ho ho ho!” “wahoowa!” 0.5 From just the outputs guess the states (and machine)

43. Hidden Markov Model Example No Review Question Sent Review Topics No Review Question

44. Hidden Markov Model Lazy Want more challenging exam Active Student No Review Question Sent Review Topics 1.0 0.1 1.0 0.9

45. Hidden Markov Model A A K 7 2 Raise Call Fold 0.6 0.4 … 0.9 0.08 0.02 Opponent Raises 0.8 Flop: 222

46. Return PS3 front of room A-D E-K L-R S-Z