Question

Theory of Computation

need ASAP 2-3 hours

1. For the following grammar: a) Give an example of a string accepted by the grammar. b) Give an example of a string not accepted by the grammar. c) Describe the language produced by the grammar. 2. Using the following grammar find a derivation for the string: 0001112 A0A1le C 0C2 | D Create a grammar for the language described by the following RE: Create a grammar for the following language: For the following Pushdown Automaton: 3. (11)*00 4. { 0-1 b Oc | b-a + c } 5. a) find two strings that it accepts b) find two strings that it rejects push o 6. Create a Pushdown Automaton for the language of strings of the form: 0'1a+2 with n 7, Create a Pushdown Automaton for the language of strings of the form: Onǐmk where

Answer 1

Fyon -the quat example tring accer he arammar O o SOS dence proved eample stig not geept11 THe (aguaeadesand and t's in clul iy kune y stay ting Atotttre and endi? ω. th digteren t num bers

SAE SO OAEC .AOA) S)0001118C AE) 89000 111 28 C B_) 28) string derived Suece