1 / 2

Push Down Automata (PDA)

Push Down Automata (PDA). Automata -- FA, PDA, TM Generator: CFG -- Recognizer: PDA Model of nondeterministic top-down parser. Difference between FA & PDA. We can see the difference from the following informal definition of PDA (additional memory): (1) an input string

enid
Download Presentation

Push Down Automata (PDA)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Push Down Automata (PDA) Automata -- FA, PDA, TM Generator: CFG -- Recognizer: PDA Model of nondeterministic top-down parser

  2. Difference between FA & PDA • We can see the difference from the following informal definition of PDA (additional memory): (1) an input string (2) a read head to exam input one cell at a time (3) a finite state machine to control moves (4) LIFO push down stack • DPDA is not equivalent to NPDA in representing CFL

More Related