Error analysis is a linguistic that focuses on identifying and describing the learner’s error in target language learning. This study grammatical mistakes frequently made by students who took their English placement test after enrolment at Universiti Sultan Azlan Shah. Samples from writing were collected. The errors identified, recorded, categorized analyzed. findings of this shed light most oc...

A c-ary Perfect Factor is a set of uniformly long cycles whose elements are drawn from a set of size c, in which every possible v-tuple of elements occurs exactly once. In the binary case, i.e. where c = 2, these perfect factors have previously been studied by Etzion, [2], who showed that the obvious necessary conditions for their existence are in fact sufficient. This result has recently been ...

This paper deals with the main similarities and differences that arise between past future tenses. In particular, we argue that, while propositions associated tenses are completely settled their truth-value can be evaluated at speech time, described by cannot seen as true or false utterance time since these linguistic forms ramifying, in they typically point to a variety of inertia histories wo...

Abstract A pronominal analysis of tense goes back to Partee (1973), motivated by a series proposed parallels between the interpretation tenses and that pronouns. This article revisits Partee's interpretive parallels, as well two more identified in Kratzer (1998), light subsequent developments work on both temporal relations The goal this is not argue for or against tense, but instead make clear...

The complement of a graph G is denoted by G. χ(G) denotes the chromatic number and ω(G) the clique number of G. The cycles of odd length at least five are called odd holes and the complements of odd holes are called odd anti-holes. A graph G is called perfect if, for each induced subgraph G of G, χ(G) = ω(G). Classical examples of perfect graphs consist of bipartite graphs, chordal graphs and c...