Computer Language/Logic Examples?These are some of the questions i am having within a few chapters of my automata class and would like some help if you could :) Class is online and can be hard to self teach at times, you dont have to answer all or any for that matter, just thought id ask i got a midterm coming up and would like to know how to do these. ()/ is not a word but its still used in its language? How do I show that there are other CFGs for these languages that do not use -productions.(ex i) S  aX | bX X  a | b | (ex ii) S  aX | bS | a | b X  aX | a | (ex iii) S  aS | bX X  aX | (ex iv) S  XaX | bX X  XaX | XbX | How would I convert these CFGs to CNF? (ex i) S  SS | a(ex ii) S  aSa | SSa | a(ex iii) S  aXX X  aS | bS | a(ex iv) E  E + E E  E * E E  (E) E  7 The terminals are + * ( ) 7How would I make a PDA that accepts the same language (given that a CFG makes L then a PDA makes L) S  XaaX X  aX | bX | 
Computer theory/ automata example help
automata