An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA.
Search words containing
5-letter words containing w
5-letter words containing t
5-letter words containing y
5-letter words containing m
5-letter words starting with o
5-letter words starting with m
5-letter words starting with a
5-letter words starting with i
5-letter words starting with e
5-letter words in the middle a
5-letter words in the middle s
5-letter words in the middle m
5-letter words in the middle o
5-letter words in the middle i
5-letter words ending with u
5-letter words ending with a
5-letter words ending with e
5-letter words ending with s
5-letter words ending with r
5-letter words excluding n
5-letter words excluding a
5-letter words excluding l
5-letter words excluding i
Related topics