@MISC{FLANG_2.MIZ,
  AUTHOR = {Trybulec, Micha{\l}},
  TITLE = {Regular Expression Quantifiers -- $m$ to $n$ Occurrences},
  SECTION1 = {Preliminaries},
  SECTION2 = {Addenda to \cite{FLANG_1.ABS}},
  SECTION3 = {Union of a Range of Powers},
  SECTION4 = {Optional Occurrence},
  DAY = {6},
  MONTH = {June},
  YEAR = {2007},
  ADDRESS1 = {Motorola Software Group},
  SUMMARY = {This article includes proofs of several facts
  that are supplemental to the theorems proved in \cite{FLANG_1.ABS}.
  Next, it builds upon that theory to extend the framework
  for proving facts about formal languages in general
  and regular expression operators in particular.
  In this article, two quantifiers are defined and their properties are shown:
  m to n occurrences (or the union of a range of powers)
  and optional occurrence. Although optional occurrence
  is a special case of the previous operator (0 to 1 occurrences),
  it is often defined in regex applications as a separate
  operator -- hence its explicit definition and properties in the article.
  Notation and terminology were taken
  from \cite{WALL-CHRISTIANSEN-ORWANT:2000}.}}

@BOOK{WALL-CHRISTIANSEN-ORWANT:2000,
 AUTHOR={Wall, Larry and Christiansen, Tom and Orwant, Jon},
 TITLE={Programming Perl, Third Edition},
 PUBLISHER={O'Reilly Media},
 YEAR=2000}

