Pushdown Automata
Edit Page
Report
Scan day: 16 February 2014 UTC
7
Virus safety - good
Description: A site with a formal definition of PDA, some examples and a proof that PDA accept context free languages.
We will now consider a new notion of automata (PDA). PDAs are finite automatons with a stack, i.e. a data structure which can be used to store an arbitrary number of symbols (hence PDAs have an infinite set of states) but which can be only accessed in a
Size: 253 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
Page title: | Pushdown automata |
Keywords: | notes |
Description: | Pushdown automata |
IP-address: | 128.243.21.108 |