T. Araki and N. Tokura, Flow languages equal recursively enumerable languages, Acta Informatica, vol.4, issue.3, pp.209-217, 1981.
DOI : 10.1007/BF00289261

T. Becker, O. Rambow, and M. Niv, The derivational generative power of formal systems or scrambling is beyond LCFRS, 1992.

A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

J. Dassow, Grammars With Regulated Rewriting, Formal Languages and Applications, pp.249-273, 2004.
DOI : 10.1007/978-3-540-39886-8_13

P. De-groote, Towards abstract categorial grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.148-155, 2001.
DOI : 10.3115/1073012.1073045
URL : https://hal.archives-ouvertes.fr/inria-00100529

K. Gerdes and S. Kahane, Word order in German, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.220-227, 2001.
DOI : 10.3115/1073012.1073041

J. Jedrzejowicz and A. Szepietowski, On the expressive power of the shuffle operator matched with intersection by regular sets, RAIRO - Theoretical Informatics and Applications, vol.35, issue.4, pp.379-388, 2001.
DOI : 10.1051/ita:2001125

K. Aravind and . Joshi, Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In Natural Language Parsing, CUP, pp.206-250, 1985.

Y. Kaji, R. Nakanishi, H. Seki, and T. Kasmi, The universal recognition problems for multiple context-free grammars and for linear context-free rewriting systems, IEICE Trans. Inf. & Syst, issue.1, pp.75-78, 1992.

M. Kanazawa, Abstract Families of Abstract Categorial Languages, 13th WoLLIC, pp.65-80, 2006.
DOI : 10.1016/j.entcs.2006.05.037

M. Kanazawa, Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars, Journal of Logic, Language and Information, vol.88, issue.2, pp.137-161, 2010.
DOI : 10.1007/s10849-009-9109-6

M. Kanazawa and S. Salvati, MIX is not a tree-adjoining language, Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers, pp.666-674, 2012.

M. Kuhlmann and M. Möhl, Mildly context-sensitive dependency languages, ACL, 2007.

M. Lopatková, M. Plátek, and V. Kubon, Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction, TSD, pp.140-147, 2005.
DOI : 10.1007/11551874_18

R. Muskens, Separating Syntax and Combinatorics in Categorial Grammar, Research on Language and Computation, vol.3, issue.3, pp.267-285, 2007.
DOI : 10.1007/s11168-007-9035-1
URL : https://hal.archives-ouvertes.fr/hal-00412582

R. Parikh, On Context-Free Languages, Journal of the ACM, vol.13, issue.4, pp.570-581, 1966.
DOI : 10.1145/321356.321364

O. Rambow, Multiset-valued linear index grammars, Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, pp.263-270, 1994.
DOI : 10.3115/981732.981768

W. L. Ruzzo, Tree-size bounded alternation, Journal of Computer and System Sciences, vol.21, issue.2, pp.218-235, 1980.
DOI : 10.1016/0022-0000(80)90036-7

S. Salvati, Probì emes de filtrage etprobì eme d'analyse pour les grammaires catégorielles abstraites, 2005.

S. Salvati, Mix is a 2-MCFL and the word problem in Z 2 is solved by a third-order collapsible pushdown automaton, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00564552

A. Shaw, Software descriptions with flow expressions. Software Engineering, IEEE Transactions on, vol.4, issue.3, pp.242-254, 1978.

S. Shieber, Direct parsing of ID/LP grammars, Linguistics and Philosophy, vol.2, issue.2, pp.135-154, 1984.
DOI : 10.1007/BF00630810