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
@@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
@@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
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
Please accept our thanks for a great presentation Sir 🙏🙏
Your explanation is very clear
Short and precise 😊
u made this easy to understand
Very clear to understand
Thx for making the video
Thanks a lot man for your appreciation... Please share my Vedios with your friends.. For further communication you can contact me at instagram..
Help full videos🎉
You are awesome!!
It helped me a lot. Thanks a lot.
What a talent
Thank u very much big brother... Thx for clearing my doubt in this topic.. 👏👏✌️✌️
Thanks for your appreciation brow.. For further communication you can contact me at instagram..
@@THEGATEHUB Insta id...
Please go to about section on my RUclips channel and click on instagram then I hope you will find my instagram id.. Thanks brow
good explanation
Thanks for your appreciation.. Please share my Vedios with your friends..
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
recursive language: Turing machine accepts every string in language L and rejects all strings that don't match the strings of L.
@@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
@@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
@@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.
@@sarnab1956 yes..now it's clear ..for further communication you can contact me at Instagram..insta I'd is in channel about section.
maza aa gaya
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
🙏🙏