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