Hi guys I'm studying AUTOMATA, I am having a really hard time with these two problems. How do I prove thiese two problems please?

Problems 1. Given an alphabet Y, an instance of the symbol find problem over Y consists of a string w over together with a single symbol E Y. The instance is true if and only if some symbol of the string w is equal to a. Prove that the symbol find problem over is in Nick's Class. 2. Prove that every regular language is in Nick's Class. Problems 1. Given an alphabet Y, an instance of the symbol find problem over Y consists of a string w over together with a single symbol E Y. The instance is true if and only if some symbol of the string w is equal to a. Prove that the symbol find problem over is in Nick's Class. 2. Prove that every regular language is in Nick's Class

Question

Hi guys I'm studying AUTOMATA, I am having a really hard time with these two problems. How do I prove thiese two problems please?

image text in transcribed

Problems 1. Given an alphabet Y, an instance of the symbol find problem over Y consists of a string w over together with a single symbol E Y. The instance is true if and only if some symbol of the string w is equal to a. Prove that the symbol find problem over is in Nick's Class. 2. Prove that every regular language is in Nick's Class. Problems 1. Given an alphabet Y, an instance of the symbol find problem over Y consists of a string w over together with a single symbol E Y. The instance is true if and only if some symbol of the string w is equal to a. Prove that the symbol find problem over is in Nick's Class. 2. Prove that every regular language is in Nick's Class