@MISC{REWRITE2.MIZ,
  AUTHOR = {Trybulec, Micha{\l}},
  TITLE = {String Rewriting Systems},
  SECTION1 = {Preliminaries},
  SECTION2 = {XFinSequence Yielding Functions and Finite Sequences},
  SECTION3 = {Concatenation of an XFinSequence with All Elements of an XFinSequence Yielding Function},
  SECTION4 = {Semi-Thue Systems and Thue Systems},
  SECTION5 = {Direct Derivations},
  SECTION6 = {Reduction Relation},
  SECTION7 = {Derivations},
  SECTION8 = {Languages Generated by Semi-Thue Systems},
  SECTION9 = {Equivalence of Semi-Thue Systems},
  DAY = {17},
  MONTH = {July},
  YEAR = {2007},
  ADDRESS1 = {Motorola Software Group},
  SUMMARY = {Basing on the definitions from \cite{WAITE-GOOS:1984},
  semi-Thue systems, Thue systems, and direct derivations are introduced.
  Next, the standard reduction relation is defined that, in turn,
  is used to introduce derivations using the theory from \cite{REWRITE1.ABS}.
  Finally, languages generated by rewriting systems are defined as all strings
  reachable from an initial word. This is followed by the introduction
  of the equivalence of semi-Thue systems with respect to the initial word.}}

@BOOK{WAITE-GOOS:1984,
 AUTHOR={Waite, William M. and Goos, Gerhard},
 TITLE={Compiler Construction},
 PUBLISHER={Springer-Verlag New York Inc.},
 YEAR=1984}

