Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1124

Title: non-deterministic pushdown automaton
Issue Date: 8-Dec-2006
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/PushdownAutomaton.html
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
URI: http://www.citidel.org/handle/10117/1124
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
PushdownAutomaton.html27KbHTMLView/Open

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