problems of decidability and undecidability in tabular form

The concept of "decidability" in the context of languages refers to:a.The ability to generate strings in a language.b.The ability to recognize a language efficiently.c.The existence of an algorithm that determines membership in a language.d.The ability to simulate any Turing machine

When can we say that the language is decidable or undecidable?

If � 1 L 1 ​ is decidable and � 2 L 2 ​ is recognisable then (select all that apply): The following checkbox options contain math elements, so you may need to read them in your screen reader's “reading” or “browse” mode instead of “forms” or “focus” mode. Choice 1 of 3: � 1 ∪ � 2 L 1 ​ ∪L 2 ​ is decidable. Choice 2 of 3: � 1 ∪ � 2 L 1 ​ ∪L 2 ​ is not decidable. Choice 3 of 3:Not enough information to answer.

Suppose A ≤ B and B ≤ C and C is undecidable, then:1 pointA is decidableA is undecidableB is decidableB is undecidableA could be decidable or undecidable, it depends on what A, B, C are.B could be decidable or undecidable, it depends on what A, B, C are.

Dans un tableur, que peut contenir une formule ?Question 28Select one or more:a.Une fonction.b.Une référence de cellule.c.Un nombre.d.Un opérateur arithmétique.e.Un format.