-
1 gate
1. ім.1)логічний елемент; вентиль; логічна схема2) затвор (напр. польового транзистора); керуючий електрод3) пост; робоче місце4) селекторний [стробуючий] імпульс, строб-імпульс2. дієсл. здійснювати селекцію в часі, стробувати - AND gate
- AND–NOR gate
- AND-NOT gate
- AND-OR gate
- back gate
- Boolean gate
- channelless sea gates
- closed-geometry gate
- coincidence gate
- control gate
- digital logic gate
- digital summation threshold logic gate
- discrete gate
- doped polysilicon gate
- double-input gate
- DSTL gate
- emitter-coupled logic gate
- emitter-coupled gate
- equivalent gate
- erase gate
- exclusive NOR gate
- exclusive OR gate
- expandable gate
- fan-in gate
- fan-out gate
- fault-free gate
- faulty gate
- finger gate
- floating gate
- functional gate
- IIL gate
- I2L gate
- imaging gate
- inclusive OR gate
- inspectation gate
- intrinsic gate
- inverting gate
- isolated gate
- Josephson-junction logic gate
- Josephson logic gate
- Josephson tunneling logic gate
- logic gate
- majority gate
- meander gate
- MOS gate
- MOSFET gate
- multiple-level logic gate
- multiple-level gate
- NAND gate
- negation gate
- negative gate
- negative AND gate
- nitride gate
- NOR gate
- NOT gate
- n+ poly gate
- offset gate
- OR gate
- OR–NOT gate
- polycrystalline silicon gate
- polysilicon gate
- process control gate
- QA gate
- quantum interference Joseph-son gate
- recessed gate
- refractory-metal gate
- replicate/annihilate gate
- resistive gate
- Scholtky-barriergate
- Scholtkygate
- Scholtky TTL gate
- sea gates
- self-aligned gate
- self-registered gate
- single-input gate
- single -logic level gate
- single level gate
- single-poly gate
- stacked gate
- storage gate
- transfer gate
- transistor gate
- variable threshold logic gate
- variable threshold gate
- V-groove MOS gate
- p-gate
См. также в других словарях:
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean grammar — Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Negation — For other uses, see Negation (disambiguation). In logic and mathematics, negation, also called logical complement, is an operation on propositions, truth values, or semantic values more generally. Intuitively, the negation of a proposition is… … Wikipedia
Boolean function — In mathematics, a (finitary) Boolean function is a function of the form f : B k rarr; B, where B = {0, 1} is a Boolean domain and k is a nonnegative integer called the arity of the function. In the case where k = 0, the function is essentially a… … Wikipedia
Negation normal form — A logical formula is in negation normal form if negation occurs only immediately above elementary propositions, and { } are the only allowed Boolean connectives. In classical logic each formula can be brought into this form by replacing… … Wikipedia
Boolean — Any variable that can have a logical value of true or false. Named after George Boole, the developer of a branch of algebra based on the values of true and false, Boolean works with logical rather than numeric relationships. Boolean… … Dictionary of networking
Minimal negation operator — In logic and mathematics, the minimal negation operator u! is a multigrade operator ( u {k}) {k in mathbb{N where each u {k}! is a k ary boolean function defined in such a way that u {k}(x 1, ldots , x k) = 1 if and only if exactly one of the… … Wikipedia
