@InProceedings{Bertsch_Nederhof:2001_1,
      AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan},
      TITLE = {On the Complexity of some Extensions of RCG Parsing},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19},
      PAGES = {66-77},
      ADDRESS = {Beijing, China},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01c.ps.gz},
      ABSTRACT = {We consider the parsing problem for range concatenation grammars (RCGs). Two new applications of RCG parsing are studied. The first is the parsing of finite automata, the second is string-to-string transduction, with an extension of RCGs. We show that these problems are undecidable in general, but become tractable for subclasses of the formalism.},
      ANNOTE = {COLIURL : Bertsch:2001:CSE.pdf Bertsch:2001:CSE.ps}
}