Writing Machine Directory/statemachines

Writing-Machines/State-Machines

A state machine is a behavior model. Multiple states are connected through transitions and have accepting and non-accepting states. Based on the current state and a given input the machine performs state transitions and produces outputs. These state machines were made during class.

Aquarium Conversation Simulator

Nod-Blink-Yawn State Machine

> in
to give a touch of human warmth 
to our schematic demonstration
Clara van Bloemendaal is the dragon of Arnhem
>
touch
>
NOD
>
TURN OPPOSITE x4
>
touch Clara
>
touch Clara has
>
touch Clara has to do with
>
touch Clara has to do with straightforward
>
touch Clara has to do with straightforward dragon
>
touch Clara has to do with straightforward dragon
> out
</div>

State Machine 2

igraph {
label="Youjung and Barbara's writing machine
( ^a          ) ^a "
labelloc="t"
speaker [shape=doublecircle];
listener [shape=doublecircle label="listener\n ^v
(   ^`      ^m ^`     ) ^v "];
input [shape=plaintext]
output [shape=plaintext]
rankdir=LR;
        input -> speaker
        speaker -> listener [label="quietly say 
        the sentence"]
        speaker -> speaker [label="I said..."]
        listener -> output
        listener -> speaker [label="Pardon?"]
}
</div>

State Machine 3

State Machine 4

State Machine 5