Consider the following Turing Machine M over the alphabet {a, b} and tape alphabet ${a, b, □}$

The language accepted by the above M is

Open in App

Solution

$The Turing Machine T accepts the regular language a a^{} + b b^{}$

So, option(b) is correct.

Suggest Corrections

Similar questions

\sum = {a} and Γ = {a, □} .

C o n s i d e r t h e f o l l o w i n g N F A M, o v e r t h e a l p h a b e t a . L e t L M b e t h e l a n g u a g e a c c e p t e d b y t h e N F A M . L e t M d e n o t e t h e m a c h i n e o b t a i n e d b y t h e f i n a l a n d n o n f i n a l s t a t e s r e s p e c t i v e l y . T h e n w h i c h o f t h e f o l l o w i n g s t a t e m e n t s i s t r u e a b o u t L M a n d L M ?

Consider < M > be the encoding of a Turing Machine as a string over alphabet \sum = {0, 1} . Consider L = {< M > | M is TM which halts on all the input and L(M) =L' for some undecidable language L^{'}} .

ω ε

ϕ

\sum^{*}

\sum

ω

ω ε

Join BYJU'S Learning Program