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 e
5-letter words containing d
5-letter words containing t
5-letter words containing o
5-letter words starting with l
5-letter words starting with a
5-letter words starting with i
5-letter words starting with r
5-letter words starting with o
5-letter words in the middle l
5-letter words in the middle i
5-letter words in the middle e
5-letter words in the middle g
5-letter words ending with m
5-letter words ending with h
5-letter words ending with n
5-letter words ending with p
5-letter words excluding u
5-letter words excluding m
5-letter words excluding d
5-letter words excluding n
Related topics