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
Ask your self questions can help you think of what to measure, in order to get answers.
That it is a tool that does its job well, it's a technology that works.
Answer:
x = 5, the data type is integer( integer data type is for whole numbers)
2. The data type is string
3. The data type is float (float data type is for decimals)
Explanation:
<span>.jumbotron p
{
color: #fff;
font-size: 20px;
}</span>
