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