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 t
5-letter words containing l
5-letter words containing v
5-letter words containing e
5-letter words containing g
5-letter words starting with e
5-letter words starting with t
5-letter words starting with d
5-letter words starting with w
5-letter words in the middle k
5-letter words in the middle l
5-letter words in the middle n
5-letter words in the middle p
5-letter words ending with i
5-letter words ending with l
5-letter words ending with o
5-letter words ending with u
5-letter words ending with t
5-letter words excluding c
5-letter words excluding g
5-letter words excluding l
5-letter words excluding o
5-letter words excluding i
Related topics