1 / 3

Pushdown Automata - Examples

Pushdown Automata - Examples. Lecture 18 Section 2.2 Mon, Oct 1, 2007. Examples. Design a PDA that accept the following language. { w | w contains an equal number of a ’s and b ’s}. Examples. Let  = { a , b , c , +, *, (, )}. Design a PDA that accepts

benjamin
Download Presentation

Pushdown Automata - Examples

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. Pushdown Automata - Examples Lecture 18 Section 2.2 Mon, Oct 1, 2007

  2. Examples • Design a PDA that accept the following language. • {w | w contains an equal number of a’s and b’s}

  3. Examples • Let  = {a, b, c, +, *, (, )}. • Design a PDA that accepts {w | w contains balanced parentheses} • Design a PDA that accepts {w | w is a valid algebraic expression}

More Related