Qn.4 Consider the moves of a PDA, A = (Q = {q0,41},£ = {a, b}, A = {a,b, Zo},8, qo, Zo), that accepts a certain language L over E = {a, b} by empty stack. The transition function 8() of A is defined below: 8(q0, a, X ) ={(40, bbX)}, X e {b, Zo}// replace the symbol X on the stacktop with bbX 5(g0, €, X) ={(q1, X)}// ignore stacktop, making e-transition to state qi 8(q1,b, b) ={(q1, €)}// pop b from the stack 8(41, €, b) ={(41, e)}// pop b from the stack , when input string is exhausted 8(q1, €, Zo) ={(41, €)}// empty stack (b) Give a description the language accepted by the above PDA in this form: L = {w e {a, b}*| w = ? (give a structural description of w) }.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Please quickly  , thanks !!!

4b

Qn.4 Consider the moves of a PDA, A = (Q = {q0,91}, £ = {a, b}, A = {a, b, Zo}, ô, qo, Zo), that
accepts a certain language L over E = {a,b} by empty stack. The transition function 8() of
A is defined below:
8(g0, a, X) ={(40; bbX)}, X € {b, Zo}// replace the symbol X on the stacktop with bbX
8(q0, €, X) ={(q1, X)}// ignore stacktop, making e-transition to state q1
8(q1,b, b) ={(q1, €)}// pop b from the stack
8(q1,€, b) ={(41, €)}// pop b from the stack , when input string is exhausted
8(q1, €, Zo) ={(g1, €)}// empty stack
(b) Give a description the language accepted by the above PDA in this form: L = {w €
{a, b}*| w = ? (give a structural description of w) }.
Transcribed Image Text:Qn.4 Consider the moves of a PDA, A = (Q = {q0,91}, £ = {a, b}, A = {a, b, Zo}, ô, qo, Zo), that accepts a certain language L over E = {a,b} by empty stack. The transition function 8() of A is defined below: 8(g0, a, X) ={(40; bbX)}, X € {b, Zo}// replace the symbol X on the stacktop with bbX 8(q0, €, X) ={(q1, X)}// ignore stacktop, making e-transition to state q1 8(q1,b, b) ={(q1, €)}// pop b from the stack 8(q1,€, b) ={(41, €)}// pop b from the stack , when input string is exhausted 8(q1, €, Zo) ={(g1, €)}// empty stack (b) Give a description the language accepted by the above PDA in this form: L = {w € {a, b}*| w = ? (give a structural description of w) }.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY