ch8ans - Because L1 L2 = Ga b c ,n 0 is not deterministic...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Formal Language Assignment Answer Chapter 8.1 2. 7. (d) We use pumping lemma to prove L is not context-free. There exist a string W belong to L. Let W g a G b G c G±² . b |vxy| ³ m , |vy| ´ 1 Case1: If vy g a µ or vy g b µ , then we can pick i ´ 2 . Case2: If vy g c µ and 1 ³ k ¶ · , then we can pick i g 0 . Case3: If vy g a µ b ¸ and 1 ³ k ¹ j ¶ · , then we can pick i ´ 2 . Case4: If vy g b µ c ¸ ,1 ³ k,j and k ¹ j ¶ · , then we can pick i g 0 . Note: uv º xy º z g a G b G»µ c G±²»¸ , 1 ³ j
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Chapter 8.2 11. Let L1 g Ga ± b ± c ² ,n ³ 0,m ³ 0´ , L2 g Ga ± b ² c ² ,n ³ 0,m ³ 0´ We know L1 and L2 are both deterministic context-free.
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Because L1 L2 = Ga b c ,n 0 is not deterministic context-free. The family of context-free languages is not closed under intersection By textbook page 198 and 199 L3 g Ga b ,n 0 , L4 g Ga b ,n 0 are both deterministic context-free. Because L3 L4 = Ga b ,m g n or m g 2n,n 0 is not deterministic context-free. The family of deterministic context-free languages is not closed under union. 17....
View Full Document

This note was uploaded on 05/07/2010 for the course COMPUTER S 138 taught by Professor Icamarra during the Spring '10 term at UCLA.

Page1 / 2

ch8ans - Because L1 L2 = Ga b c ,n 0 is not deterministic...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online