We propose an algorithm for the transfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as a word over a vocabulary of description elements (nodes, arcs, labels), and a collection of graphs as a set of such words, that is, as a language over description elements. A packed representation for the collection of...

We say that two hypergraphs H1 and H2 with v vertices each can be packed if there are edge disjoint hypergraphs H ′ 1 and H ′ 2 on the same set V of v vertices, where H ′ i is isomorphic to Hi. It is shown that for every fixed integers k and t, where t ≤ k ≤ 2t − 2 and for all sufficiently large v there are two (t, k, v) partial designs that cannot be packed. Moreover, there are two isomorphic ...