In: Computer Science
I'm looking to study for my theory of computation exam, so I'd like you to write a sample problem and answer it based on the topic below. If you also wouldn't mind, could you also explain what you're doing.
"Given a language, find a number of strings that are pairwise distinguishable with respect to the language. For each pain of strings, find a distinguisher."
***Please give a like if you are satisfied with the answer. If you have any doubts or you need any further information ask me through comments. THANK YOU! and ALL THE BEST ***