Elizabeth Prior claims that dispositional predicates are incomplete in the sense that they have more than one argument place. To back up this claim, she offers a number of arguments that involve such ordinary dispositional predicates as ‘fragile’, ‘soluble’, and so on. In this paper, I will first demonstrate that one of Prior’s arguments that ‘is fragile’ is an incomplete predicate is mistaken....

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...

We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts.

We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets. Most monoids considered in this paper are finite. In particular, we use the term variety of monoids for variety of finite monoids. Similarly, all languages considered in this paper are regular languages and hence their syntactic monoid is finite.

Aiming at the problem that traditional text-level sentiment analysis methods usually ignore emotional tendency corresponding to object or attribute. In this paper, a novel two-stage fine-grained model based on syntactic rule matching and deep semantics is proposed. Based analyzing characteristics difficulties of analysis, algorithm framework constructed. first stage, objects its opinions are ex...

We compute the cardinality of the syntactic monoid of the language 0∗ rep b (mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to some well studied problem: decide whether or not a brecognizable sets of integers is ultimately periodic.

Our work addresses the automatic detection of paraphrastic rephrasing in spoken corpus. The proposed approach is syntagmatic. It is based on paraphrastic rephrasing markers and the specificities of the spoken language. Manual annotation performed by two annotators provides fine-grained and multi-dimensional description of the reference data. Automatic method is proposed in order to decide wheth...

We provide a precise representation for, and a calculation of the length of, possible path independent determinateness hierarchies of Field’s construction in [4]. We further show in the hierarchies Fα of Fieldian truth sets, and Herzberger’s Hα revision sequence starting from any recursive hypothesis for F0 (or H0) that essentially each Hα (or Fα) carries within it the history of the whole prio...

Let K be an anti-ideal of a semigroup (S,=, =, ·, θ) with apartness. A construction of the anti-congruence Q(K) and the quasi-antiorder θ, generated by K, are presented. Besides, a construction of the anti-order relation Θ on syntactic semigroup S/Q(K), generated by θ, is given in Bishop’s constructive mathematics.

We show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed as final coalgebras in a category of relations. The well-known case of bisimulation will simply be a special case of such final predicates. We will show how some useful pointwise and mixed properties of streams can be modelled in this way.