-
1 dynamic input with negation
инверсный динамический вход
-
[ГОСТ 2.743-91]Параллельные тексты EN-RU
Dynamic input with negation
Only the transition from value 1 to value 0 is effective.
[Schneider Electric]Инверсный динамический вход
Логический элемент реагирует только на перепад входного сигнала от значения логической 1 до значения логического 0.
[Перевод Интент]Тематики
- Булева алгебра, элементы цифровой техники
EN
Англо-русский словарь нормативно-технической терминологии > dynamic input with negation
См. также в других словарях:
инверсный динамический вход — [ГОСТ 2.743 91] Параллельные тексты EN RU Dynamic input with negation Only the transition from value 1 to value 0 is effective. [Schneider Electric] Инверсный динамический вход Логический элемент реагирует только на перепад входного сигнала от… … Справочник технического переводчика
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
applied logic — Introduction the study of the practical art of right reasoning. The formalism (formal logic) and theoretical results of pure logic can be clothed with meanings derived from a variety of sources within philosophy as well as from other… … Universalium
APL (programming language) — APL Paradigm(s) array, functional, structured, modular Appeared in 1964 Designed by Kenneth E. Iverson Developer Kenneth E. Iverson … Wikipedia
Prolog — infobox programming language paradigm = Logic programming year = 1972 designer = Alain Colmerauer implementations = BProlog, ECLiPSe, Ciao Prolog, GNU Prolog, Quintus, SICStus, Strawberry, SWI Prolog, YAP Prolog, tuProlog dialects = ISO Prolog,… … Wikipedia
Race condition — in a logic circuit. Here, ∆t1 and ∆t2 represent the propagation delays of the logic elements. When the input value (A) changes, the circuit outputs a short spike of duration (∆t1+∆t2) ∆t2 = ∆t1. A race condition or race hazard is a flaw in an… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
ECONOMIC AFFAIRS — THE PRE MANDATE (LATE OTTOMAN) PERIOD Geography and Borders In September 1923 a new political entity was formally recognized by the international community. Palestine, or Ereẓ Israel as Jews have continued to refer to it for 2,000 years,… … Encyclopedia of Judaism
MAD (programming language) — MAD Paradigm(s) Imperative Appeared in 1959 Developer Galler, Arden, and Graham Major implementations IBM 704, IBM 7090, UNIVAC 1108, Philco 210 211, IBM S/360, and IBM S/370 … Wikipedia
Longest increasing subsequence — The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not… … Wikipedia