F. Barthélemy, P. Boullier, P. Deschamp, and . De-la-clergerie, Guided parsing of range concatenation languages, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.42-49, 2001.
DOI : 10.3115/1073012.1073019

E. Bertsch and M. Nederhof, On the complexity of some extensions of rcg parsing, Proceedings of IWPT'01, 2001.

P. Boullier, New Developments in Parsing Technology, volume 23 of Text, Speech and Language Technology, chapter Range Concatenation Grammars, pp.269-289, 2004.

D. Jeffrey, J. E. Hopcroft, and . Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.

B. Lang, RECOGNITION CAN BE HARDER THAN PARSING, Computational Intelligence, vol.13, issue.1, pp.486-494, 1994.
DOI : 10.1016/S0019-9958(67)80007-X

. Joshi, Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th Meeting of the Association for Comput. Linguist. (ACL'87), pp.104-111, 1987.