### Table 1 Summary of the decidability/undecidability results. p stands for \decidable quot;, and for \undecidable quot;.

2003

Cited by 6

### Table 1 Summary of the decidability/undecidability results. p stands for \decidable quot;, and for \undecidable quot;.

### Table 1: D stands for determinism, N for nondeterminism, d for decidable, u for undecidable and t for trivial; arrows indicate how (un)decidability results trivially propagate. When writing m-d.d. we assume m 1.

"... In PAGE 16: ... Table1 summarizes the results on the (un-)decidability status of code proper-... ..."

### Table 1 summarizes the results on the (un-)decidability status of code properties for various language classes.

2000

"... In PAGE 13: ... Table1 : D stands for determinism, N for nondeterminism, d for decidable, u for undecidable and t for trivial; arrows indicate how (un)decidability results trivially propagate.... ..."

Cited by 3

### Table 1. Main decidability results (U=undecidable, D = decidable, Emp. = Emptiness, Mem.= Membership).

### Table 1. Main decidability results (U=undecidable, D = decidable, Emp. = Emptiness, Mem.= Membership)

### Table 2. Statistics for the MATCH Task with the REJECT (Undecided) Option.

1996

"... In PAGE 4: ... Statistics for the MATCH Task. Experiments were carried out when the REJECT / UNDECIDED option becomes available and the results are displayed in Table2 . The REJECT / UNDECIDED option corresponds to that case when the AFR system is undecided about what recognition should be made.... ..."

Cited by 5

### Table 1: (Un)decidability of the equational theories of classes of cylindric algebras.

1999

"... In PAGE 6: ... In fact, the expansion Crs+ 3 of Crs3 with a single operation k1 1 has an undecidable equational theory. We summarized these results in Table1 . We note that, similarly to the relation algebra case, the unde- cidable equational theories are in fact r.... ..."

Cited by 4

### Table 1 summarizes the main decidability results of this paper: + (?) means that the satis ability problem for the corresponding language in the corresponding class of structures is decidable (undecidable). The results do not depend on whether the parameters are from N or Q+. For various fragments we will also obtain NExpTime upper bounds for the computational complexity. The fragments MSi[Q+/N] are de ned in Section 3. D

"... In PAGE 4: ... Table1 : The satis ability problem for metric logics. The structure of the paper is as follows: Section 2 introduces the syntax and semantics of both, the rst-order and the `modal apos; languages of metric spaces.... ..."