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
False, absolute references have two dollar signs
Answer:
the answer is d have a nice day
Explanation: i got a 100
Answer:
Option 2 i.e., instance methods is the correct answer to the following question.
Explanation:
Because the instance method or function is the function that needed the class object to be called.
<u>For Example:</u>
//header file
#include <iostream>
using namespace std;
//define class
class Test
{
public:
//instance method
void getins()
{
cout<<"I AM Instance method";
}
};
int main()
{
//creating object
Test obj;
//calling of instance method through class object
obj.getins();
}
<u>Output</u>:
I AM Instance method
Answer:
You can try afdah or 123 movies, maybe try Netflix if you have it
Explanation:
The sites do have ads but that's where I usually watch my movies
