If we consider words over the alphabet which is the set of all elements of a semigroup S, then such a word determines an element of S: the product of the letters of the word. S is strongly locally testable if whenever two words over the alphabet S have the same factors of a fixed length k, then the products of the letters of these words are equal. We had previously proved [19] that the syntacti...

goal: this study aims at analyzing and categorizing different grammatical errors including morpho-syntactic and syntactic errors in written narratives of mentally retarded students in tehran. the frequencies of errors are compared among students in different grades. method: descriptive-analytic method has been used. a test consisted of four picture stories have been administered to 125 students...

Contributors: Michael Lewis Schneir (author), Wendy Kingdom (section editor), Any Whereat editor)

Japanese Bare Nouns (JBNs) appear to behave like indefinites in some contexts, and mass nouns in some other contexts. For example, when accomplishment verbs have JBNs as their theme, they are modified by both in-adverbs and for-adverbs. This paper first claims that JBNs are weak indefinites and introduce a variable to be bound by Existential Closure. Second, it shows how telic predicates are de...

Rauzy graphs of subshifts are endowed with an automaton structure. For Sturmian subshifts, it is shown that its transition semigroup is the syntactic semigroup of the language recognized by the automaton. A projective limit of the partial semigroups of nonzero regular elements of their transition semigroups is described. If the subshift is minimal, then this projective limit is isomorphic, as a...

This paper deals with the problem of the projection of arguments, i.e., how the arguments of a predicate are integrated into a syntactic structure. My starting point is the model offered in Borer (1993). This model is defined by Borer as a 'syntactic predicate based account' of the projection of arguments. In the next section I will briefly sketch the different approaches to the problem of argu...

Carnap (in, [ I ] , p. 566) has remarked that his measure function m* is jitting fof finite languages using a fixed number of one-place predicates, i.e., for any sentence i, m*(;) is the same In all such restricted finite languages in which i occurs. The main purpose of this brief note is to show by means of a counter-example that * does not have the intuitively desirable property of fittingne...

We prove that for any finite prefix code X with n elements, the non special subgroups in the syntactic monoid of X have degree at most n − 1. This implies in particular that the groups in the syntactic monoid of X are all cyclic when X is a prefix code with three elements.