@MISC{FSM_3.MIZ,
  AUTHOR = {Trybulec, Micha{\l}},
  TITLE = {Equivalence of Deterministic and Nondeterministic Epsilon Automata},
  SECTION1 = {Preliminaries},
  SECTION2 = {Transition Systems over Lex{\,}{\em E}},
  SECTION3 = {Powerset Construction for Transition Systems},
  SECTION4 = {Semiautomata},
  SECTION5 = {Left-languages},
  SECTION6 = {Automata},
  SECTION7 = {Right-languages},
  SECTION8 = {Languages Accepted by Automata},
  SECTION9 = {Equivalence of Deterministic and Nondeterministic Epsilon Automata},
  DAY = {25},
  MONTH = {May},
  YEAR = {2009},
  ADDRESS1 = {YAC Software\\ Warsaw, Poland},
  SUMMARY = {Based on concepts introduced in \cite{REWRITE3.ABS}, 
  semiautomata and left-languages, automata and right-languages, 
  and langauges accepted by automata are defined. The powerset 
  construction is defined for transition systems, semiautomata 
  and automata. Finally, the equivalence of deterministic and 
  nondeterministic epsilon automata is shown.}}

