Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: non-deterministic pushdown automaton
Issue Date: 8-Dec-2006
Publisher: PlanetMath
Abstract: A non-deterministic pushdown automaton (or PDA) is a variation on the idea of a non-deterministic finite automaton (NDFA). Unlike an NDFA, a PDA is associated with a stack (hence the name ... pushdown ). The transition function must also take into account the state of the stack. Formally defined, a non-deterministic pushdown automaton is a 6-tuple ... . ... and
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback