IF L1 and L2 are languages are recognised by machines m1 and m2 with n and m states

Question

Comments

answer can not be concluded,

suppose L1= ($\epsilon$ + a + aa), it will require M=4 states machine

L2 = (a+b)*, it will require M=1 state machine, now,

L1.L2 = (a+b)*, it will require M=1 state machine.

Answer 1

Construction of FA a.b from regular expression require no of states in a + no of states in b including episilon transition also so it might require less then a+b no of states excluding epsilon transition but definitely more than a and b no. of states and less than ab no. of states so more correct answer is m+n states