Unable to get the correct k-map for this finite state machine (Crosswalk System)
I like these problems. They're like Sudoku for EEs.

I am not familiar with your style of Karnaugh-map. I will show you how we were taught this.

The state register has two flip-flops with inputs D1, D0 and outputs Q1, Q0. We have inputs TC, C7 and RESET. Reset is a special case. If we want it to be asynchronous then we connect it to the reset input of the flip-flops, and then it does not enter into our logic equations. If we want it to be synchronous then we do use it in the equations, but its function is so simple that we can keep it out of the K-maps.

First we will deal with the state transitions, then with the outputs.



D1 and D0 get their own K-maps. Reset is 'R' and you can eliminate it if we're to use asynchronous resets.



Now the outputs. Since the outputs only depend on the state values and not the inputs (name that state machine), it makes it easy to write the output equations by inspection.

WALK is only on in state 00.  WALK = !Q1 * !Q0    (! means 'not')

HAND is on in states 11 and 10.    HAND = Q1

NUM_ON is on in states 01 and 11.  Num_on = Q0

Finally EN is only off in state 01.   EN = !( !Q1 * Q0)