pumping$65478$ - перевод на немецкий
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

pumping$65478$ - перевод на немецкий

Pumping Lemma; Pumping argument

pumping      
n. Pumpen; Heraussaugen
pumping station         
  • Abbey Mills]] in London. The concrete platforms used to house large motor / pump assemblies that brought sewage up from a deep main drain into several outfall sewers, taking it away from the city centre.
  • A land drainage pumping station in [[Sète]], [[France]].
FACILITIES INCLUDING PUMPS AND EQUIPMENT FOR PUMPING FLUIDS FROM ONE PLACE TO ANOTHER
Pumping Station; Sewerage Pumping Station; Pump station; Pump house; Packaged pump station; Pumping stations; Pump Station; Lift station; List of pumping stations; Pump-house
Zapfsäule, Tankstelle
gastric lavage         
MEDICAL PROCEDURE TO CLEAN OUT THE CONTENTS OF THE STOMACH
Stomach pump; Stomach-pump; Gastric irrigation; Stomach pumping; Nasogastric aspiration and lavage; Ewald tube; Gastrolavage; Gastrointestinal lavage
Magen auspumpen

Определение

Pumping
In incandescent lamps a periodical recurring change in intensity due to bad running of the dynamos, or in arc lamps to bad feeding of the carbons. Fig. 277. SPRENGEL AIR PUMP.

Википедия

Pumping lemma

In the theory of formal languages, the pumping lemma may refer to:

  • Pumping lemma for regular languages, the fact that all sufficiently long strings in such a language have a substring that can be repeated arbitrarily many times, usually used to prove that certain languages are not regular
  • Pumping lemma for context-free languages, the fact that all sufficiently long strings in such a language have a pair of substrings that can be repeated arbitrarily many times, usually used to prove that certain languages are not context-free
  • Pumping lemma for indexed languages
  • Pumping lemma for regular tree languages