Please accept our thanks for a great presentation Sir 🙏🙏
@coderwork8335 Жыл бұрын
Your explanation is very clear
@taukirsheikh94053 жыл бұрын
Very clear to understand Thx for making the video
@THEGATEHUB3 жыл бұрын
Thanks a lot man for your appreciation... Please share my Vedios with your friends.. For further communication you can contact me at instagram..
@anjaliverma9053 жыл бұрын
Short and precise 😊
@Abhishekkumar-rm2te3 жыл бұрын
u made this easy to understand
@shraddharajput9106 Жыл бұрын
Help full videos🎉
@dalsukhnaneradalsukhnanera2862 Жыл бұрын
What a talent
@jannatkhan7225 Жыл бұрын
You are awesome!!
@mariakhan57153 жыл бұрын
It helped me a lot. Thanks a lot.
@anirbanchatterjee92864 жыл бұрын
Thank u very much big brother... Thx for clearing my doubt in this topic.. 👏👏✌️✌️
@THEGATEHUB4 жыл бұрын
Thanks for your appreciation brow.. For further communication you can contact me at instagram..
@anirbanchatterjee92864 жыл бұрын
@@THEGATEHUB Insta id...
@THEGATEHUB4 жыл бұрын
Please go to about section on my KZbin channel and click on instagram then I hope you will find my instagram id.. Thanks brow
@vinspatel39443 жыл бұрын
good explanation
@THEGATEHUB3 жыл бұрын
Thanks for your appreciation.. Please share my Vedios with your friends..
@knowhereeverythingchannel23517 ай бұрын
maza aa gaya
@sarnab19562 жыл бұрын
sir agar language accept ho raha hai tm se sirf tabhi language recursive hai ya looping chorke accept ya reject koi bhi ho dono case me hi language recursive hai
@sarnab19562 жыл бұрын
sir I have one confusion u said for Rec - tm either rejects or accepts my doubt is language accepted by tm only is recursive or both accepted + rejected by tm belong to recursive language
@THEGATEHUB2 жыл бұрын
recursive language: Turing machine accepts every string in language L and rejects all strings that don't match the strings of L.
@sarnab19562 жыл бұрын
@@THEGATEHUB sir if a language is accepted by tuning machine it's recursive,if it's rejected ( halts on non final state) its recursive or non recursive
@sarnab19562 жыл бұрын
@@THEGATEHUB matlab agar tuning machine language ko accept kar raha hai tabhi language recursive hai warna non recursive Ya tuning machine language accept kar raha hai final state me jake + reject yani halt kar raha hai non final state me dono case me language recursive hai Sirf agar loop me Jata hai tab non resursive hai
@THEGATEHUB2 жыл бұрын
@@sarnab1956 If L is a recursive language then − If w ∈ L then a TM halts in a final state, If w ∉ L then TM halts in a non-final state.
@THEGATEHUB2 жыл бұрын
@@sarnab1956 yes..now it's clear ..for further communication you can contact me at Instagram..insta I'd is in channel about section.