contestada

Consider the following language:

L={ |M is a Turing Machine and M accepts at least one palindrome,

and rejects at least one palindrome}

a. Is L a decidable language? Prove your answer.

b. Is L a recognizable language? Prove your answer.

Respuesta :

Martebi

L is a decidable language because the Turing machine accepts it.

L is a recognizable language if  TM M recognizes it.

How do you know if a language is decidable?

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

https://brainly.com/question/16936315

#SPJ1

Otras preguntas