查询词典 Boolean value

And using Boolean Union connect it to the other part.

和使用布尔联盟将它连接到其他部分。

Our research is carried out on the basis of the Boolean process.

本项目以该理论为基础展开研究工作。

To emphasize the binary nature of this problem, it is frequently referred to as Boolean or propositional satisfiability.

强调二进制的性质这一问题，这是经常被称为布尔或命题满足。

Based on the theory of Boolean model, this article designed and realized an Information Retrieval system.

在布尔模型的理论基础上设计并实现了一个信息检索系统，本文对系统的概要设计、详细设计步骤都做出详细地介绍，并且对系统的主要代码进行了说明。

"The best thing about a boolean is even if you are wrong, you are only off by a bit."

布尔值最好的地方是尽管你是错的，你只是错了一位。

An object of type boolean can have one of two values, true and false.

布尔类型的对象可以具有两个值： t 和 f 。

The sequential Cireut model with fuzzy border is set up on the bases of Boolean defferetial and fuzzy border set.

在布尔微分及乏晰边沿集合两个基础上，建立了乏晰边沿的时序电路模型。

B. Declaration of primitive types such as boolean, byte and so on allocates memory space for the variable.

B。 对原始数据类型例如boolean，byte的变量的声明将为之分配内存空间。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。