Thus, the Pin-Reutenauer procedure is one of the ingredients to understand why a given class has

decidable separation problem.

Theorem 2 (Guba (1993b), Theorem A) For m [greater than or equal to] 3, k [greater than or equal to] 1, the word problem for the semigroup B(A, m, k) is

decidable.

We shown that DECAand RMECAare determinizable, thus closed under complementation; also that their respective language inclusion problems are

decidable (more exactly, PSPACE-complete).

As Abrams puts it, there is no ground, in the incessant play of difference that constitutes a language, for attributing a

decidable meaning, or even a finite set of determinately multiple meanings to any sign (57).

The properties of such metrics will be similarly dependent upon the model and not

decidable a priori, which further signals the fundamentally empirical, inductive nature of the approach.

But at the same time we are saying that a modest level of import tariff and an export tariff is

decidable," he said.

The critical is its object; the deconstruction always bears, at one moment or another, on the confidence invested in the critical or critico-theoretical process, that is to say, in the act of decision, in the ultimate possibility of the

decidable.

The question of whether we are sick because of Oedipus, that is, because of the modern domestication of our essentially anarchic desires, or whether, on the contrary, it is the Oedipus complex as a psychological theory which helps us understand and come to terms with this conflict is, Deleuze and Guattari maintain, strictly u n

decidable.

It is well known that determining the treewidth of a graph poses an NP-complete problem, but its restriction to graphs with bounded treewidth is

decidable in polynomial time [1].

2003), which is a subset of first-order logic that provides sound and

decidable reasoning support.

Positive results [15, 8] state that the problem of equivalence is

decidable when exponentiation and division are added to polynomial operations.

Considering the broad scope of the set of data types defined in [8], including functions, however, it is clear that not every data type has a

decidable homomorphism.

Since the discussion never can be concerned with anything else than a very positive and very

decidable question (are we wandering away from, or coming closer to Mecca?

Not all polar propositions are effectively

decidable.

Since in classical deducible research, a theory T of language L is said complete if any sentence of L is

decidable in T, we can say that an S-denied theory is partially complete (or has some degrees of completeness and degrees of incompleteness).