Перевод: с немецкого на русский

с русского на немецкий

dc+pumping

Страницы
  • 1
  • 2

См. также в других словарях:

  • Pumping station — Pumping stations are facilities including pumps and equipment for pumping fluids from one place to another. They are used for a variety of infrastructure systems that many people take for granted, such as the supply of water to canals, the… …   Wikipedia

  • Pumping Iron — Saltar a navegación, búsqueda Pumping Iron Título Pumping Iron Ficha técnica Dirección Robert Fiore George Butler Producción Jerome Gary Guión …   Wikipedia Español

  • Pumping — can refer to: *The operation of a pump, for moving a liquid from one location to another **The use of a breast pump or milking machine for extraction of milk *Pumping (oil well), injecting chemicals into a wellbore *Pumping (computer systems),… …   Wikipedia

  • Pumping Iron 2 — Données clés Titre original The Comeback Réalisation Geoff Bennett Acteurs principaux Arnold Schwarzenegger Tom Platz Sergio Olivier Pays d’origine …   Wikipédia en Français

  • Pumping — Pump ing, a. & n. from {pump}. [1913 Webster] {Pumping engine}, a steam engine and pump combined for raising water. See {Steam engine}. [1913 Webster] …   The Collaborative International Dictionary of English

  • Pumping engine — Pumping Pump ing, a. & n. from {pump}. [1913 Webster] {Pumping engine}, a steam engine and pump combined for raising water. See {Steam engine}. [1913 Webster] …   The Collaborative International Dictionary of English

  • Pumping (computer systems) — Pumping, when referring to computer systems, is simply how many times per clock cycle data is being transmitted. Early types of system memory (RAM), such as SDRAM, transmitted data on only the peaks of the cycles. With the advent of double data… …   Wikipedia

  • Pumping-Lemma — Das Pumping Lemma bzw. Pumplemma (auch Schleifensatz genannt) beschreibt in der theoretischen Informatik eine Eigenschaft bestimmter Klassen formaler Sprachen. In vielen Fällen lässt sich anhand des Lemmas nachweisen, dass eine formale Sprache… …   Deutsch Wikipedia

  • Pumping Lemma — Das Pumping Lemma bzw. Pumplemma beschreibt in der theoretischen Informatik eine Eigenschaft bestimmter Klassen formaler Sprachen. In vielen Fällen lässt sich anhand des Lemmas nachweisen, dass eine formale Sprache nicht regulär bzw. nicht… …   Deutsch Wikipedia

  • Pumping lemma for regular languages — In the theory of formal languages, the pumping lemma for regular languages describes an essential property of all regular languages. Informally, it says that all sufficiently long words in a regular language may be pumped that is, have a middle… …   Wikipedia

  • Pumping lemma for context-free languages — The pumping lemma for context free languages, also known as the Bar Hillel lemma, is a lemma that gives a property that all context free languages have. Its primary use is to prove a language is not context free.The pumping lemma for context free …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»