「decidable」の共起表現(1語右で並び替え)

The theory of pure equality was proven to be decidable by Lowenheim in 1915.

ion, any decision problem can be shown to be decidable by exhibiting an algorithm for it that termi

ive property, safety of a SP-DEVS network is decidable by (1) generating the finite-vertex reachabi

ome first-order theories are algorithmically decidable; examples of this include Presburger arithme

ects of these theories can be treated within decidable fragments with simple qualitative (non-metri

are the languages decidable in exponential time

type of formal language which is also called decidable or Turing-decidable.

We say that the Domino Problem is decidable or undecidable according to whether there ex

ems for which many verification problems are decidable, owing to the existence of a kind of order b

terminology, by inductively reducing them to decidable properties of finite lists.

er a fixed finite or countable alphabet is a decidable set.

particular star-free languages are a proper decidable subclass of regular languages.

Despite being decidable, the admissibility problem has relatively hi

about deterministic pushdown automata: it is decidable whether a given deterministic pushdown autom

「decidable」の共起表現一覧(1語右で並び替え)