A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
An insertion grammar is based on pure rules of the form uu + lc~v (the string x is inserted in the context (u,u)). A strict subfamily of the context-sensitive family is obtained, incomparable with the family of linear languages. We prove here that each recursively enumerable language can be written as the weak coding of the image by an inverse morphism of a language generated by an insertion grammar (with the maximal length of stings u, u as above equal to seven). This result is ratherdoi:10.1016/s0304-3975(97)00079-0 fatcat:5bngvgfwpzagxm5rqqbdrhoqbm