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 a
5-letter words containing k
5-letter words containing h
5-letter words starting with f
5-letter words starting with e
5-letter words starting with a
5-letter words starting with i
5-letter words in the middle z
5-letter words in the middle e
5-letter words in the middle n
5-letter words ending with n
5-letter words ending with g
5-letter words ending with v
5-letter words ending with o
5-letter words ending with i
5-letter words excluding c
5-letter words excluding z
5-letter words excluding e
5-letter words excluding v
5-letter words excluding a
Related topics