Question

what is the minimal corresponding maching (Finite Automata, Pushdown Automata, or Turing Machine) for each of the following languages? State which method is being used

P3) What is the minimal corresponding machine (FA, PDA or TM) for each of the following languages? (You must provide proper explanations or proofs for your answer.) (30 points) o) L1 (every strings consist with a and b 0, 00,000), 0). (b) L2 balanced parenthesises , For example L2- (a) Ls ab" al n 20)

Answer 1

4 eve"I sta langi can be repr } ng, con elst unt, a and b DFA しに @+b) Thts Langsoge can be vepeb sina PDA Push au oper poranthesus Pop all closed Paranthesis | S-> CAJA A (A) e Gratn mar 20 on be vepoesemded in anguoge con ust Stacr, pop A por each A on top

I f there are any doubts, comment down here. Weareright here to help you. H appyLearning..!! Please HITaLIKEif youlike the answer, it really Boosts us..! Please HITaLIKEif youlike the answer, it really Boosts us..!!