rarily large machines. See "A Multiple Substring Search Algorithm"
    by Moishe Halibard and Moshe Rubin in June 2002 issue of CUJ for a good
    example (unfortunately not available online).</li>

    <li>On the other side are state machine frameworks which require the
    layout to be specified at compile time</li>
  </ul>

  <p>State machines that are built at runtime almost always get away with a
  simple state model (no hierarchical states, no orthogonal states, no entry
  and exit actions, no history