-
1 Maul
n (5) 1. ağız, cəhəng; üz (heyvanda); 2. dan. kobud ağız; 3. tex. ağız (məngənə və s.); ◊ j-m Honig / Pappe ums \Maul schmieren dan. kimisə dilə tutmaq, kimisə dilə tutub razı salmaq, kiməsə yaltaqlanmaq; ein großes \Maul haben lovğalanmaq; dilini saxlaya bilməmək; ein loses \Maul haben ağızdan yava olmaq; ein (schiefes) \Maul machen sımsırığını sallamaq; ◊ ein süßes \Maul machen ikiüzlülük etmək; das \Maul halten* dilini saxlamaq; halts \Maul! kobud. səsini kəs, ağzını yum!; das \Maul aufreißen* / vollnehmen* özünü tərifləmək, sich das \Maul verbrennen* məc. ağzı yanmaq (müvəffəqiyyətsizliyə uğramaq); ◊ Einem geschenkten Gaul sieht / schaut man nicht ins \Maul ata. söz. Bəy verən atın dişinə baxmazlar; Eine gebratene Taube fliegt keinem ins \Maul ata. söz. Halva-halva deməklə ağız şirin olmaz; j-m das \Maul stopfen kiminsə ağzını qapamaq (yummaq); j-m übers \Maul fahren* dan. kiminsə ağzından vurmaq / sözünü kəsmək; das \Maul nach etw. spitzen nəyinsə həsrətini çəkmək; ich konnte mir das \Maul wischen əlim hər şeydən çıxdı
См. также в других словарях:
halts — [akin to Eng halt] : lame … Gothic dictionary with etymologies
halts — hÉ”Ëlt n. temporary stop, standstill; break or pause in a march or journey v. stop, pause; cause to stop; hesitate, be uncertain adj. crippled, lame (Archaic) … English contemporary dictionary
halts — 1) shalt 2) stahl … Anagrams dictionary
halts — present third singular of halt plural of halt … Useful english dictionary
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
List of stations and halts on the Talyllyn Railway — A map of the Talyllyn Railway This is a list of the stations and halts on the Talyllyn Railway (Welsh: Rheilffordd Talyllyn), a 2 ft 3 in (686 mm) narrow gauge preserved railway line running for 7.25 miles (11.67 km) … Wikipedia
List of stations and halts on the Welsh Highland Railway — This is a list of the stations and halts on the Welsh Highland Railway Original *Dinascite web url = http://www2.whr.co.uk/s/history/history3 title = Welsh Highland Railway History: The Route Described accessdate=2008 08 21 author=Alun Turner… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … Wikipedia
Qana airstrike — The 2006 Qana airstrike was an attack by the Israel Air Force (IAF) on a three story [http://www.dailystar.com.lb/article.asp?edition id=1 categ id=1 article id=84174 Qana stronger on anniversary of Israeli attack] , Daily Star , July 30, 2007]… … Wikipedia
Rice's theorem — In computer science, Rice s theorem named after Henry Gordon Rice (also known as The Rice Myhill Shapiro theorem after Rice and John Myhill) states that, for any non trivial property of partial functions, there exists at least one algorithm for… … Wikipedia
