-
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 variable — noun Any variable, from the domain of Boolean algebra, having one of only two values … Wiktionary
Boolean network — A Boolean network consists of a set of Boolean variables whose state is determined by other variables in the network. They are a particular case of discrete dynamical networks, where time and states are discrete, i.e. they have a bijection onto… … Wikipedia
Boolean domain — In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true . In mathematics and theoretical computer science, a Boolean domain is usually written as {0,1} or {ot … Wikipedia
Boolean Algebra — A division of mathematics which deals with operations on logical values. Boolean algebra traces its origins to an 1854 book by mathematician George Boole. The distinguishing factor of Boolean algebra is that it deals only with the study of binary … Investment dictionary
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 — [bo͞o′lē ən] adj. 〚after G. Boole (1815 64), Eng mathematician〛 designating or of any of a number of mathematical systems, esp. one (Boolean algebra) devised using algebraic rules and symbols for the analysis of symbolic logic, which is now… … Universalium
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 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
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-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… … Wikipedia
