D. Gildea, Optimal parsing strategies for linear context-free rewriting systems, Human Language Technologies: The 11th Annual Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference, 2010.

C. Gómez-rodríguez and G. Satta, An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two, Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2, ACL-IJCNLP '09, pp.985-993, 2009.
DOI : 10.3115/1690219.1690284

C. Gómez-rodríguez, M. Kuhlmann, G. Satta, and D. J. Weir, Optimal reduction of rule length in linear context-free rewriting systems, Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics on, NAACL '09, 2009.
DOI : 10.3115/1620754.1620833

A. Michael and . Harrison, Introduction to Formal Language Theory, 1978.

K. Aravind, L. S. Joshi, and . Levy, Constraints on local descriptions: Local transformations, SIAM Journal of Computing, 1977.

M. Kuhlmann and G. Satta, Treebank grammar techniques for non-projective dependency parsing, Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on, EACL '09, 2009.
DOI : 10.3115/1609067.1609120
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.333.4267

W. Maier and T. Lichte, Characterizing Discontinuity in Constituent Treebanks, Proceedings of the 14th Conference on Formal Grammar, 2009.
DOI : 10.1007/978-3-642-20169-1_11

W. Maier and A. Søgaard, Treebanks and mild context-sensitivity, Proceedings of the 13th Conference on Formal Grammar, pp.61-76, 2008.

O. Rambow and G. Satta, Independent parallelism in finite copying parallel rewriting systems, Theoretical Computer Science, vol.223, issue.1-2, pp.87-120, 1999.
DOI : 10.1016/S0304-3975(97)00190-4

G. Satta, Recognition of linear context-free rewriting systems, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, 1992.
DOI : 10.3115/981967.981979

H. Seki, T. Matsumura, M. Fujii, and T. Kasami, On multiple context-free grammars, Theoretical Computer Science, vol.88, issue.2, pp.191-229, 1991.
DOI : 10.1016/0304-3975(91)90374-B
URL : http://doi.org/10.1016/0304-3975(91)90374-b

K. Vijay-shanker, D. J. Weir, and A. K. Joshi, Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th annual meeting on Association for Computational Linguistics -, 1987.
DOI : 10.3115/981175.981190
URL : http://acl.ldc.upenn.edu/P/P87/P87-1015.pdf

D. J. Weir, Linear context-free rewriting systems and deterministic tree-walk transducers, Proceedings of the 30th Meeting of the Association for Computational Linguistics (ACL'92), 1992.
DOI : 10.3115/981967.981985
URL : http://acl.ldc.upenn.edu/P/P92/P92-1018.pdf