@MISC{REWRITE3.MIZ,
  AUTHOR = {Trybulec, Micha{\l}},
  TITLE = {Labelled State Transition Systems},
  SECTION1 = {Preliminaries},
  SECTION2 = {Transition Systems over Subsets of ${E}^{\omega}$},
  SECTION3 = {Productions},
  SECTION4 = {Direct Transitions},
  SECTION5 = {Reduction Relation},
  SECTION6 = {Reduction Sequences},
  SECTION7 = {Reductions},
  SECTION8 = {Transitions},
  SECTION9 = {Acceptance of Words},
  SECTION10 = {Reachable States},
  DAY = {05},
  MONTH = {May},
  YEAR = {2009},
  ADDRESS1 = {YAC Software\\ Warsaw, Poland},
  SUMMARY = {This article introduces labelled state transition systems, 
  where transitions may be labelled by words from a given alphabet.
  Reduction relations from \cite{REWRITE1.ABS} are used to define 
  transitions between states, acceptance of words, and reachable states. 
  Deterministic transition systems are also defined.}}

