L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
<h3>How do you know if a language is decidable?</h3>
A language is said to be decidable only when there seems to exists a Turing machine that is said to accepts it,
Here, it tends to halts on all inputs, and then it answers "Yes" on words that is seen in the language and says "No" on words that are not found in the language. The same scenario applies to recognizable language.
So, L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
Learn more about programming language from
brainly.com/question/16936315
#SPJ1
Answer:
D) Unsupervised Data mining
Explanation:
Unsupervised data mining also refered to as undirected data mining reveals hidden patterns in unlabeled data. In this method, there are no output variables to predict. The aim of an unsupervised data mining technique is to uncover patterns in data based on the relationship between the data points and each other
Answer And explanation
a)
has 1/
probability guess the correct source
b)
Each element in
is mapped by
/
. There are
So there are
-1 elements.
number of target elements = 
number of source elements =
-1
probability =
-1 /
c) Probability of the correct target element
1/