A grammar G is a particular finite subset of A and the language of the grammar is all words which f maps to a subset of G. For L T,k , the grammar can be thought of as the set of permissible factors on tier T and the function is w → F k (⋊E T (w)⋉).
every word is mapped to the set of k-factors present on tier T .