问题3： ·算法A接受一个语言和算法A判定一个语言有什么区别？ The language accepted by an algorithm A is the set of strings L={x E{0,1):A(x)=1,that is,the set of strings that the algorithm accepts. A language L is decided by an algorithm A if every binary string in L is accepted by A and every binary string not in L is rejected by A. to accept a language,an algorithm need only produce an answer when provided a string in L,but to decide a language,it must correctly accept or reject every string in{0,1}.问题3： • 算法A接受一个语言和算法A判定一个语言有什么区别？