Computer Science, asked by Yashkv9796, 1 year ago

Show that language l={w1cw2 where w1 is not equal to w2 } is a regular language

Answers

Answered by karniga8
0

Answer:

a toggle key is the answer

Similar questions