@inproceedings{aarts-1995-acyclic,
    title = "Acyclic Context-sensitive Grammars",
    author = "Aarts, Erik",
    editor = "Hajicova, Eva  and
      Lang, Bernard  and
      Berwick, Robert  and
      Bunt, Harry  and
      Carpenter, Bob  and
      Church, Ken  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Nagao, Makoto  and
      Nijholt, Anton  and
      Steedman, Mark  and
      Thompson, Henry  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Wilks, Yorick  and
      Wittenburg, Kent",
    booktitle = "Proceedings of the Fourth International Workshop on Parsing Technologies",
    month = sep # " 20-24",
    year = "1995",
    address = "Prague and Karlovy Vary, Czech Republic",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-emnlp/1995.iwpt-1.2/",
    pages = "1--9",
    abstract = "A grammar formalism is introduced that generates parse trees with crossing branches. The uniform recognition problem is NP-complete, but for any fixed grammar the recognition problem is polynomial."
}