@InCollection{Nederhof:2000_3,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {Regular Approximation of CFLs: A Grammatical View},
      YEAR = {2000},
      BOOKTITLE = {Advances in Probabilistic and other Parsing Technologies},
      PAGES = {221-241},
      EDITOR = {Bunt, Harry and Nijholt, Anton},
      PUBLISHER = {Kluwer Academic Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.ps.gz},
      ABSTRACT = {We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.},
      ANNOTE = {COLIURL : Nederhof:2000:RACa.pdf Nederhof:2000:RACa.ps}
}