-
1 language
- advanced Boolean expression language
- advanced continuous simulation language
- application control language
- application data description language
- asynchronous circuit design language
- basic design language for structure
- behavioral description language
- behavioral modeling language
- block diagram language
- block structured language
- computer language
- computer design language
- computer-sensitive language
- context-sensitive matrix language
- continuous system modeling program language
- continuous system simulation language
- control and simulation language
- data асcess system language
- declarative language
- design language
- digital design language
- formal layout description language
- general-purpose language
- geometrical layout description language
- graphics-oriented language
- hardware description language
- hierarchical specification language
- high-level language
- imperative language
- integrated-circuit design language
- linear information processing language
- linkage control language
- logic, timing, sequencing language
- low-level language
- machine-dependent language
- machine-independent language
- modeling language
- modular language
- multilevel-architecture description language
- network description language
- network restructuring language
- nonprocedural language
- operating-system simulation language
- operational control language
- operator-oriented language
- overview language
- parallel context-free array language
- problem-oriented language
- procedural language
- program assembly language
- rational language
- real-time language
- register transfer level language
- self-extending language
- structured design language
- structure description language
- symbolic layout description language
- type 0 1, 2, 3 language
- type 0 language
См. также в других словарях:
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Parallel transport — In geometry, parallel transport is a way of transporting geometrical data along smooth curves in a manifold. If the manifold is equipped with an affine connection (a covariant derivative or connection on the tangent bundle), then this connection… … Wikipedia
Parallel array — In computing, a parallel array is a data structure for representing arrays of records. It keeps a separate, homogeneous array for each field of the record, each having the same number of elements. Then, objects located at the same index in each… … Wikipedia
Linear feedback shift register — [ xor gate provides feedback to the register that shifts bits from left to right. The maximal sequence consists of every possible state except the 0000 state.] A linear feedback shift register (LFSR) is a shift register whose input bit is a… … Wikipedia
System of linear equations — In mathematics, a system of linear equations (or linear system) is a collection of linear equations involving the same set of variables. For example,:egin{alignat}{7}3x ; + ; 2y ; ; z ; = ; 1 2x ; ; 2y ; + ; 4z ; = ; 2 x ; + ; frac{1}{2} y ; ; z … Wikipedia
Concurrent data structure — In computer science, a concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer. Historically, such data structures were used on uniprocessor machines with… … Wikipedia
Primary structure — In biochemistry, the primary structure of a biological molecule is the exact specification of its atomic composition and the chemical bonds connecting those atoms (including stereochemistry). For a typical unbranched, un crosslinked biopolymer… … Wikipedia
Algebraic structure — In algebra, a branch of pure mathematics, an algebraic structure consists of one or more sets closed under one or more operations, satisfying some axioms. Abstract algebra is primarily the study of algebraic structures and their properties. The… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
Quotient space (linear algebra) — In linear algebra, the quotient of a vector space V by a subspace N is a vector space obtained by collapsing N to zero. The space obtained is called a quotient space and is denoted V / N (read V mod N ). Definition Formally, the construction is… … Wikipedia