Page 1 of 1
(iv) Prove that the language of this CFG is the set of all words in (a + b)* with an even number of a's with the followi
Posted: Fri May 06, 2022 6:17 am
by answerhappygod
- Iv Prove That The Language Of This Cfg Is The Set Of All Words In A B With An Even Number Of A S With The Followi 1 (177.98 KiB) Viewed 33 times
(iv) Prove that the language of this CFG is the set of all words in (a + b)* with an even number of a's with the following exception: We consider the word A to have an even number of a's, as do all words with no a's, but of the words with no a's only A can be generated. (v) Show how the difficulty in part (iv) can be alleviated by adding the production S→XS