The data structure of this name supports operations like "peek", which looks at the top element without removing it.
The use of a computation model containing one of these elements allows one to prove the version of the pumping lemma that replicates two sections of a string in parallel. A deterministic finite automaton with two of these elements is equivalent to a Turing machine, while the set of context free languages can be recognized by a DFA with one of these modifications, a model known as a PDA. Allocating memory in a region with this name relies on its namesake (*) frames and is contrasted with dynamic memory allocation, which uses the heap. The data structure of this name supports operations like "peek", which looks at the top element without removing it. For 10 points, name this data structure which uses operations like "push" and "pop" to support last-in first-out access.
The use of a computation model containing one of these elements allows one to prove the version of the pumping lemma that replicates two sections of a string in parallel.
stacks