A_{REX} = {⟨R, w⟩| R is a regular expression that generates string w} is an undecidable language.

A language L, for which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is called

A Turing-recognizable language is also known as 

A multi-tape Turing machine can be transformed into a single-tape Turing machine 

Which of the following is a Turing machine with an attached printer.

Every Turing-recognizable language is decidable

A problem can be solved by an algorithm if and only if it can be solved by a Turing Machine 

Turing machine (TM) is more powerful than FMS (Finite State Machine) because