Перевод и анализ слов искусственным интеллектом
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое push-down - определение
![[[Dornier Seawings Seastar]]](https://commons.wikimedia.org/wiki/Special:FilePath/Dornier Seastar D-ICKS.jpg?width=200 "[[Dornier Seawings Seastar]]")
![Rutan Model 40 Defiant]]](https://commons.wikimedia.org/wiki/Special:FilePath/Rutan-Defiant-N57KS.jpg?width=200 "Rutan Model 40 Defiant]]")
![Rutan Model 76 Voyager]]](https://commons.wikimedia.org/wiki/Special:FilePath/VoyagerAircraftAtNASM-common.jpg?width=200 "Rutan Model 76 Voyager]]")
![[[Adam A500]]](https://commons.wikimedia.org/wiki/Special:FilePath/Adam500-N504AX-051111-02.jpg?width=200 "[[Adam A500]]")
![[[Network Rail]] [[Driving Brake Standard Open]] in October 2009](https://commons.wikimedia.org/wiki/Special:FilePath/DBSO 9714 Ogston.jpg?width=200 "[[Network Rail]] [[Driving Brake Standard Open]] in October 2009")
![Alnmouth]] in June 2005](https://commons.wikimedia.org/wiki/Special:FilePath/GNER train steams into Alnmouth Station - 07 June 2005.jpg?width=200 "Alnmouth]] in June 2005")
![A single [[GWR Autocoach]] capable of steam push–pull operation](https://commons.wikimedia.org/wiki/Special:FilePath/GWR Autocoach.jpg?width=200 "A single [[GWR Autocoach]] capable of steam push–pull operation")
![A [[Metra]] train in push mode, with a non-locomotive passenger car in the front. Note the engineer's station in the upper level of the passenger car.](https://commons.wikimedia.org/wiki/Special:FilePath/Geneva Metra 071020.jpg?width=200 "A [[Metra]] train in push mode, with a non-locomotive passenger car in the front. Note the engineer's station in the upper level of the passenger car.")
![Push–pull train in [[Slovakia]]](https://commons.wikimedia.org/wiki/Special:FilePath/Lokomotiva 109 E2.jpg?width=200 "Push–pull train in [[Slovakia]]")
![driving van trailer]] in [[Ireland]]](https://commons.wikimedia.org/wiki/Special:FilePath/Mallow IÉ-4006.jpg?width=200 "driving van trailer]] in [[Ireland]]")
![A [[New Jersey Transit]] train with [[Bombardier ALP-46]] locomotives on both ends and 11 cars in between, in [[New Jersey]], United States.](https://commons.wikimedia.org/wiki/Special:FilePath/NEC train 3967 passing through Rahway station, June 2007.jpg?width=200 "A [[New Jersey Transit]] train with [[Bombardier ALP-46]] locomotives on both ends and 11 cars in between, in [[New Jersey]], United States.")
![datum]] on the stack. A push operation decrements the pointer and copies the data to the stack; a pop operation copies data from the stack and then increments the pointer. Each procedure called in the program stores procedure return information (in yellow) and local data (in other colors) by pushing them onto the stack. This type of stack implementation is extremely common, but it is vulnerable to [[buffer overflow]] attacks (see the text).](https://commons.wikimedia.org/wiki/Special:FilePath/ProgramCallStack2 en.svg?width=200 "datum]] on the stack. A push operation decrements the pointer and copies the data to the stack; a pop operation copies data from the stack and then increments the pointer. Each procedure called in the program stores procedure return information (in yellow) and local data (in other colors) by pushing them onto the stack. This type of stack implementation is extremely common, but it is vulnerable to [[buffer overflow]] attacks (see the text).")
Википедия
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines (see below). Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages, with the former often used in parser design.
The term "pushdown" refers to the fact that the stack can be regarded as being "pushed down" like a tray dispenser at a cafeteria, since the operations never work on elements other than the top element. A stack automaton, by contrast, does allow access to and operations on deeper elements. Stack automata can recognize a strictly larger set of languages than pushdown automata. A nested stack automaton allows full access, and also allows stacked values to be entire sub-stacks rather than just single finite symbols.
