Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

5. [10 points] Let = {0, 1} and define a language L over as L = {0 10 10 : n> 1} Show that L

image text in transcribed

5. [10 points] Let = {0, 1} and define a language L over as L = {0" 10" 10" : n> 1} Show that L is not context-free. Remark: Compare this with language Si on page 106, which is context free. Hint: Let p be the pumping constant and consider the string s = OP 10P 10P. Write s as in the Pumping Lemma. Either vy has no zeros, or it has at least one zero, consider these cases separately. 5. [10 points] Let = {0, 1} and define a language L over as L = {0" 10" 10" : n> 1} Show that L is not context-free. Remark: Compare this with language Si on page 106, which is context free. Hint: Let p be the pumping constant and consider the string s = OP 10P 10P. Write s as in the Pumping Lemma. Either vy has no zeros, or it has at least one zero, consider these cases separately

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Repairing And Querying Databases Under Aggregate Constraints

Authors: Sergio Flesca ,Filippo Furfaro ,Francesco Parisi

2011th Edition

146141640X, 978-1461416401

More Books

Students also viewed these Databases questions

Question

2. Outline the different types of interviews

Answered: 1 week ago