Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
14K views

Lecture 18 - Pushdown Automata - Examples

The document discusses examples of pushdown automata (PDAs) and homework assignments involving PDAs. It reviews a homework problem on a PDA that recognizes a language containing strings with matching numbers of a's, b's, and c's. It then provides an example of a PDA that accepts strings with an equal number of a's and b's. Finally, it lists additional PDA design problems as assignments involving languages with balanced parentheses and other constraints.

Uploaded by

Sudhanshu Joshi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
14K views

Lecture 18 - Pushdown Automata - Examples

The document discusses examples of pushdown automata (PDAs) and homework assignments involving PDAs. It reviews a homework problem on a PDA that recognizes a language containing strings with matching numbers of a's, b's, and c's. It then provides an example of a PDA that accepts strings with an equal number of a's and b's. Finally, it lists additional PDA design problems as assignments involving languages with balanced parentheses and other constraints.

Uploaded by

Sudhanshu Joshi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Pushdown

Automata -
Examples

Robb T.
Koether

Homework
Pushdown Automata - Examples
Review
Lecture 18
Examples of
PDAs Section 2.2
Assignment

Robb T. Koether

Hampden-Sydney College

Mon, Oct 6, 2008


Outline

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review
1 Homework Review
Examples of
PDAs

Assignment
2 Examples of PDAs

3 Assignment
Homework Review

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review
Exercise 2.10, page 129.
Examples of
PDAs Give an informal description of a pushdown automaton that
Assignment
recognizes the language

A = {ai bj ck | i = j or j = k where i, j, k ≥ 0}.


Homework Review

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review
Solution
Examples of The language A is the union of the languages
PDAs

Assignment
{ai bi ck | i, k ≥ 0}

and
{ai bk ck | i, k ≥ 0}.
Homework Review

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review
Solution
Examples of A PDA for the first of these languages is
PDAs

Assignment a, ε → a b, a → ε c, ε → ε

ε, ε → $ ε, ε → ε ε, $ → ε
Homework Review

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review
Solution
Examples of A PDA for the second language is
PDAs

Assignment a, ε → ε b, ε → b c, b → ε

ε, ε → $ ε, ε → ε ε, $ → ε
Homework Review

Pushdown
Automata -
Examples

Robb T.
Koether
Solution
Homework
Therefore, a PDA for the language A is
Review

Examples of
PDAs a, ε → a b, a → ε c, ε → ε
Assignment
ε, ε → $ ε, ε → ε ε, $ → ε
ε, ε → ε

a, ε → ε b, ε → b c, b → ε

ε, ε → ε ε, ε → ε ε, ε → $ ε, $ → ε
Examples

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review

Examples of Example (Pushdown automaton)


PDAs

Assignment
Design a PDA that accepts the language

{w | w contains an equal number of a’s and b’s}.


Examples

Pushdown
Automata -
Examples

Robb T.
Koether Example (Pushdown automaton)
Homework
The strategy will be to keep the excess symbols, either
Review a’s or b’s, on the stack.
Examples of
PDAs One state will represent an excess of a’s.
Assignment
Another state will represent an excess of b’s.
We can tell when the excess switches from one symbol
to the other because at that point the stack will be
empty.
In fact, when the stack is empty, we may return to the
start state.
Examples

Pushdown
Automata -
Examples Example (Pushdown automaton)
Robb T.
Koether a, ε → a
b, a → ε
Homework
Review a>b

Examples of
PDAs
a, ε → $ b. $ → ε
Assignment

b, ε → $ a. $ → ε

a<b

a, b → ε
b, ε → b
Examples

Pushdown
Automata -
Examples

Robb T.
Koether

Homework
Review

Examples of Example (Pushdown automaton)


PDAs

Assignment
Note that this solution is inspired by the grammar

S → SS | aSb | bSa | ε
Examples

Pushdown
Automata -
Examples

Robb T.
Koether
Example (Pushdown automata)
Homework
Review Let Σ = {a, (, )}. Design a PDA whose language is
Examples of
PDAs

Assignment
{w | w contains balanced parentheses}.

Let Σ = {a, b, c, +, ∗, (, )}. Design a PDA whose


language is

{w | w is a valid algebraic expression}.


Assignment

Pushdown
Automata -
Examples

Robb T.
Read Section 2.2, pages 112 - 114.
Koether
Problems 21, 22, 23, 24, page 130.
Homework
Review
Let Σ = {a, (, ), [, ]}. Design a PDA whose language is
Examples of
PDAs {w | w contains balanced parentheses and brackets}.
Assignment

Design a PDA whose language is

{an bm cm dn | m, n ≥ 0}.

Design a PDA whose language is

{an bm | n 6= m}.

You might also like