1. The number of symbols necessary to simulate a TM with 'm' symbols and 'n' states is-
a) m+n b)8mn+4m c)mn d)4mn+m
2. Any TM with m symbols and n states can be simulated by another TM with just 2 symbols and less than
a) 8mn states b)4mn+8 states c)8mn+4 states d)mn states
3. The number of states of the FSM,required to simulate the behaviour of a computer,with a memory capable of storing 'm' words,each of length 'n' bits is-
a)m⨯2n b)2mn c)2m+n d)none