- switching algebra
-
алгебра переключательных схем
Англо-русский словарь технических терминов. 2005.
switching algebra
Смотреть что такое "switching algebra" в других словарях:
switching algebra — kombinacinė algebra statusas T sritis automatika atitikmenys: angl. switching algebra vok. Schaltalgebra, f rus. алгебра переключательных схем, f; релейная алгебра, f pranc. algèbre de branchement, f; algèbre de commutation, f … Automatikos terminų žodynas
Switching function — In Boolean algebra, a switching function is a function that maps n binary variables to a single binary value. Typically it is thought of as assigning 0 or 1 to each binary sequence of length n . Sources and external links * http://www.journal.tfc … Wikipedia
switching theory — Theory of circuits made up of ideal digital devices, including their structure, behaviour, and design. It incorporates Boolean logic (see Boolean algebra), a basic component of modern digital switching systems. Switching is essential to telephone … Universalium
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
kombinacinė algebra — statusas T sritis automatika atitikmenys: angl. switching algebra vok. Schaltalgebra, f rus. алгебра переключательных схем, f; релейная алгебра, f pranc. algèbre de branchement, f; algèbre de commutation, f … Automatikos terminų žodynas
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
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
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
Geometric algebra — In mathematical physics, a geometric algebra is a multilinear algebra described technically as a Clifford algebra over a real vector space equipped with a non degenerate quadratic form. Informally, a geometric algebra is a Clifford algebra that… … Wikipedia
A Symbolic Analysis of Relay and Switching Circuits — In his 1937 MIT master s thesis, A Symbolic Analysis of Relay and Switching Circuits , Claude Elwood Shannon proved that Boolean algebra and binary arithmetic could be used to simplify the arrangement of the electromechanical relays then used in… … Wikipedia
