-
1 Transition Graph
Plastics: TG -
2 State Transition Graph
Computers: STGУниверсальный русско-английский словарь > State Transition Graph
-
3 menu-transition graph
Англо-русский словарь промышленной и научной лексики > menu-transition graph
-
4 граф переходов
Русско-английский словарь по машиностроению > граф переходов
-
5 граф переходов
-
6 граф переходов
Русско-английский словарь по радиоэлектронике > граф переходов
-
7 графа переходов
Русско-английский словарь по микроэлектронике > графа переходов
-
8 граф переходов
-
9 матрица переходов
Русско-английский большой базовый словарь > матрица переходов
-
10 переход
-
11 переход
-
12 сеть переходов
Русско-английский словарь по информационным технологиям > сеть переходов
-
13 скорость на режиме перехода
Авиация и космонавтика. Русско-английский словарь > скорость на режиме перехода
-
14 эшелон перехода
Авиация и космонавтика. Русско-английский словарь > эшелон перехода
-
15 переход
-
16 граф переходов
граф переходов
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Русско-английский словарь нормативно-технической терминологии > граф переходов
-
17 граф переходов
-
18 точка перехода
-
19 граф переходов
Русско-английский новый политехнический словарь > граф переходов
-
20 диаграмма переходов
1) Engineering: state-transition diagram2) Mathematics: transition diagram3) Telecommunications: transient diagram (модели)4) Information technology: state transition diagram (конечного автомата из одних состояний в другие)5) Oil: state transition diagram6) Automation: transient graph (из одних состояний в другие), transition graph (из одних состояний в другие)7) Makarov: transient graph (из одних состоянии в другие), transition graph (из одних состоянии в другие)Универсальный русско-английский словарь > диаграмма переходов
См. также в других словарях:
transition graph — pereigų grafas statusas T sritis automatika atitikmenys: angl. transition graph vok. Transitionsgraph, m rus. граф переходов, m pranc. graphe de transitions, m … Automatikos terminų žodynas
Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… … Wikipedia
Quantum graph — In mathematics and physics, a quantum graph is a linear, network shaped structure whose time evolution is described by a system of schrödinger equations or, more generally, by a set of evolution equations associated with differential or pseudo… … Wikipedia
Augmented transition network — An augmented transition network (ATN) is a type of graph theoretic structure used in the operational definition of formal languages, used especially in parsing relatively complex natural languages, and having wide application in artificial… … Wikipedia
State transition system — In theoretical computer science, a state transition system is an abstract machine used in the study of computation. The machine consists of a set of states and transitions between states. State transition systems differ from finite state automata … Wikipedia
Marked graph — A marked graph is a Petri net in which every place has exactly one incoming arc, and exactly one outgoing arc. This means, that there can not be conflict, but there can be concurrency. Mathematically: . Marked graphs are used mostly to… … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… … Wikipedia
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… … Wikipedia