Project 7

docx

School

Portland Community College *

*We aren’t endorsed by this school

Course

464

Subject

Computer Science

Date

Nov 24, 2024

Type

docx

Pages

3

Uploaded by ProfessorIceCat10

Report
Section 7.2: 1) Following the construction of Theorem 7.1, convert this grammar to an equivalent npda: S -> aSbA|b A -> abA| λ 2) Following the construction of Theorem 7.2, convert the following npda to an equivalent grammar. Show the initial results prior to simplification, and then the final results after simplification. You don't have to show each individual step of simplification. states: {q0,q1,q2,q3} input alphabet: {a,b} stack alphabet: {A,Z} initial state: q0 stack start symbol: Z final states: {q3} transitions: δ(q2,λ,Z) = {(q3,λ)} δ(q0,λ,Z) = {(q1,AZ)} δ(q2,a,Z) = {(q1,AZ)} δ(q1,b,A) = {(q2,λ)} Section 8.1: 3) Prove that the language L with Σ = {a}, where L = {a n : n is a power of 2} is not context-free. 4) Prove that the language L = {a x b y c z : z > y, z > x} is not context-free. Section 8.2: 5) Let language L = {a,b,c}* : n a (w) = n b (w) = n c (w)}. Prove that the complement of L is context-free.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help