Question Answered step-by-step Construct a pda accepting by empty store each of the following… Construct a pda accepting by empty store each of the followinglanguages.(a) {a”blllalli m. 11 :2: I}(b) {allb:” I 11 :2: I}(c) {allblJle” I Tn. 11 2: I}(d) {a’llbll 1m > 11 :2: I}7.4 Construct a pda accepting by final state each of the languages given inExercise 7.3.7.5 Construct a context-free grammar generating each of the followinglanguages. and hence a pda accepting each of them by empty store.(a) {a” bll In :2: I} u {a’llb:m 1m :2: I}(b) {d ‘b”’all 1m. n :2: l} u {aile” In :2: I}(c) {a”Yllellld” 1m. n :2: l}7.6 Let L = {d”b!! In < m}. Construct (i) a context-free grammar acceptingL (ii) a pda accepting L by empty store. and (iii) a pda accepting Lby final state.266 g Theory ofComputer Science7.7 Do Exercise 7.6 by taking L to be the set of all strings over {a, h}consisting of twice as many a's as b's.7.8 Construct a pda accepting the set of all even-length palindromes over{a, b} by empty store.7.9 Show that the set of all strings over {a, b} consisting of equal numberof a's and b's is accepted by a detemunistic pda.7.10 Apply the construction given in Theorem 7.4 to the pda M given inExample 7.1 to get a context-free grammar G accepting N(M).7.11 Apply the construction given in Theorem 7.4 to the pda obtained bysolving Exercise 7.4.7.12 Show that {a"bl1 lll e: I} u {amb~'" 1m e: I} cannot be accepted by adeterrninistic pda.7.13 Show that a regular set accepted by a detemunistic finite automatonwith 11 states is accepted to final state by a deterministic pda with nstates and one pushdown symbol. Deduce that every regular set is adeterministic context-free language.(A context-free language is deterministic if it is accepted by a deterministic pda.)7.14 Show that every regular set accepted by a finite automaton with 11 statesis accepted by a deterministic pda with one state and 11 pushdownsymbols.7.15 If L is accepted by a detefllljnistic pda A. then show that L is acceptedby deterministic pda A which never adds more than one symbol at a. (' 'f 5:( -) - ( I .) h I I < ) tlme l.e. 1 u q, a. ~. -q, y. t en YI _ -).7.16 If L is accepted by a deterministic pda A, then show that L is acceptedby a deterministic pda A which always (i) removes the topmost symboLor (ii) does not change the topmost symboL or (iii) pushes a singlesymbol above the topmost symboL Image transcription textExercise 3: For the following NPDA, list the language of the NPDAand find its corresponding CFG b. bobb at Exercise 4: Convertthe following grammar into a Chomsky Normal Form ... Show more... Show more Image transcription text12. Choose from these facts: (a) EveryNP-complete language is recursivelyenumerable (b) If an ND... Show more... Show more Computer Science Engineering & Technology Information Security COMPUTER S 2210 Share QuestionEmailCopy link Comments (0)
