Turing Machine (Example 1)
Вставка
- Опубліковано 24 лип 2024
- TOC: Turing Machine (Example-1)
Topics discussed:
This lecture shows how to design a Turing Machine for the language 01*0
Contribute: www.nesoacademy.org/donate
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
Your channel is a life saver for every engineering students.. Love your videos, soooo good methods of explaining... SALUTE TO NESO ACADEMY...
Ya it's very helpful
Love you
But... isn't this video is for scientist?
S 🙉👌
@@sent4444 what no ,all this is indian undergrad CS engineering sylabus for 3 or 4th semester students
SALUTE TO NESO ACADEMY...
As a undergrad CS punk 🤣 i can say my collage professors need to take lessons on how to teach like you in less than 15min
:))
😂Yaah.. they take 3 classes to explain the same concept...
I read it as cm punk lol
holy crap dude.......I never knew ToC could be understood so easily........You have my respect ^_^
Such a life saver you are. Teaching with the basic concepts easily. 🌟😌
1st yay. You are heaven sent. God bless your brains and your time to teach us. Thank you for making tutorials.
Thank you soo much Sir, best i never had seen classes... Superb tq once again.
The only explanation of turing machine on youtube that makes sense ❤️
Really well explained. Thank you!
Very clear explanation. Thank you!!
Godly Explanation! Thanks
Very awesomely explained
Thanks a lot to you. Clarity in explanation.
Thank you..very well explained
wonderful explanation of a complex topic
pls also add examples on conversion of cfg to PDA and vice versa. do reply.
It's very good for understanding
good example thanks
Just need a clearification sir. Should we add one blank or infinite blank in the Tape for the input string 0110?
God bless you Sir!!!
Well explained...
Well explained. Thank you.
Soooooo good explains for us ,, very very thank you
very very thank you
Good for understanding
As per my teacher, we can't replace whole set of '1' with 'y' at once. Instead replace one '1' with 'y' at a time then again traverse back. Hope you got it!
from the future and it still saving me
you are awesome !!
I have one question sir, how can we design a TM such that (0^n 10^3n) how do we solve this?
life saver💙💙
Dude u r the best 😘
Thanks Sir JI😊😊
merci beaucoup
Why we want to differ the tape symbol and the input symbol ?
I wish all teachers taught like you
if u listen in class carefully u will understand
@@SattiSanthoshReddy Then why are you here?
@@AmanSingh-om1zu i am not a student
Thankyou sir
Does turing machine accept ∅? If no, then either ∅ is regular language or turing machine doesnot accept regular language?
how to make turing machine for double word over alphabet a,b ????
the empty string is included in 1*, hence I believe blank should be accepted as well in the B state?
@Prathmesh Tiwari SO a 1 is not needed to be accepted.
blank is not a symbol in Sigma so can't accept it
My prof for this works at lockheed and tells us we will never use it... but thanks!
a^nb^nc^m, n, m>=1, sir could u solve this question..
what if we get a string 00B, then it will be accepted .
But how did you design that machine?
Sir, what if the input is 00 blank? And how will we know if it went to the accept state or the reject state in the tape??
Should go to the reject state, as he said in the final few minutes of the video, since there is no transition drawn.
it will go to accept state Mrs.Just laugh
1* can be null.It will be accept by that reason.
I know this is an old comment but I wanted to add my answer to it. If the input is 00 blank, it still follows the rules of the language and it will be accepted. The rules are that it must start and end with 0, and there can be ANY number of 1's inbetween. I hope this helps :^)
Sir can u plzz make video on complexity theory
The machine just came out of nowhere! plz explain the steps involved in creating the machine. I can understand how it works i want to know how it is built.
what if you get a 0 at state B right after getting a 0 in state A. Shouldn't that reject the string ?
it will accept because 1* means 0 or more 1's
Respect ++
So like in this this one state, we wright on the tape and move to the right then we go right and then write some more.... Am I right? XD
Input symbol doesn't consist blank symbol right
My Teacher uses this channel to teach us
Nice
Thank you so much 😁
Very well explained but my teacher always find mistakes from this method 🤷🏻♀️🤷🏻♀️🤦♀️🤦♀️
Nice tq sir
I think if encounter two 0's continuously when we are in initial state, the TM will accept the string which should not happen.(example 1)please clarify sir
1* also includes ϵ. So, 00 is also acceptable for 01*0.
what if input is 00 only.
Sir give lecture no in title of video plz it's confusing which 2 watch frist
Hope u notice
IS IT CORRECT IF THE TM TAKING EVEN 00? LIKE ACCEPT?
BUT THE L SAYING THAT IT SHOULD BE 010 OR 01111110... BUT NOT 00
Is it necessary to draw reject state
the reject state is simply a state that only transitions to itself, it is drawn for completeness. One could leave it out for a simpler diagram of the Turing machine.
Note: if you remove the reject state for the sake of simplicity of the diagram, then it is still technically there (one would interpret the missing transitions as going to the reject state).
i love you
Turing machine uses 0.0001% of its power
Thanos dies
LOL - us turing machine folks think Marvel Movies are epic.
A very nice explanation. But I have a question:
What will happen if we get a input string '00' instead of '010'. According to your logic the input string is still going to meet the final state. Waiting for your reply.
State -> A B C 'Accept'
Tape -> x x Blank 'Blank'
Result is accept
'' mean current state/current head pointer
as stated above in some other comment, the empty string is included in 1* hence, 00 is in the language L. Thus, one should expect 00 to be accepted.
but why did you put the rehect , there is no meed
coz this turing machine is a deterministic one
Sir, is your course enough for the university examinations ??
Is this enough for gate
@@tejasri5313 of course not!!
I need more understanding in this subject 😢
why you write x not write 0
I have a doubt there your machine is going to accept 00 also which is not represented in the language hence another state should be added
It is correct as * means zero or more times
Will the string 00 is accepted??
Yes
no
I thoroughly enjoy your lectures, they are an immense help.
The example needs a slight modification though because we only want strings of the form 01*0. However, the Turing machine in the example will wrongly accept string 00. State B needs to be broken into two states B1 and B2. B1 to B2 should ensure the second alphabet of the string is a 1 and B2 can have the loop described above.
Also blank is not a input alphabet,. The example is confusing.
but 00 is also a string the form 01*0
00 is part of this language so it's correct.
So the blank state is not included in 1*? Thought it was
05:48 08:45
Yr am totally confused with Turing machine because my teacher says
One bye one replace a 0 by X then ho right move
Then come back at left move and traverse again
We can't replace it at one time
Plz sir solve my prblm
My teacher says the same thing. Same doubt after 4 yrs,,, hehe ~
1. If we don't need the tape in this particular example, why write anything to it? Cannot we just leave the writing head where it is or skip the writing process altogether? Or use the tape to write the answer?
2. So the input is not from the tape, but from "somewhere else"? Why can't we read the input from the tape then?
3. If the blank symbol is the "tape" symbol, not the "input" symbol, how come it is a part of the transition description? :q
isn’t this a finite state machine 🤔
my strange addiction
what if the string is 0010????
State -> A B C 'Reject'
Tape -> x x '1' 0
Result is reject
isnt 1* the kleene closure? so shouldnt it also allow the string "00"?
Anyone wondering does this machine accepts input 00? Yes it does, the reason is, 1* = {epsilon, 1, 11, 111...} and 00 is in the language. So this machine represents the language 01*0. Don't confuse with the Blank symbol and epsilon, they are two different concepts.
Thanks alot
Is it possible to get like from NESO in 2021?
no
What about 01100
Wouldn't it end up in the reject state since adding the extra 0 would not be in the language 01*0?
It would definitely reject. It even shows a transition there for that case.
yes you need to expand the algorithm with logical solution like how he suggested, so basically try works too
Rejected state act as dead state 🤔
Blank symbol does not belong to sigma, the input alphabet. See previous video.
What happened if we get a 0010.
amity se ho ka tau
Amity main rules change ho jaate hai kya TM ke.
00_ will be also accepted -> A B C ACCEPT. This example is wrong and you are missing one more state to design it properly
i think 1* means any no. of 1s which inludes 0 no. of 1s as well
and hence it will be accepted
1* means that there can be no instances of 1.
Sir aap English mai qu lecture dy rahi hai.... Aap bht acha padati hai or mje smj b aata hai but kuh kuh words na meri sar k upar se jati hai please🙏 aap se request hai aap hindi mai b lecture diya karo please🙏 ye meri request hai aap se... Aagay aap ki marxi sir.... Thank you so much
i don't know why he don't show us how does he draw it in the video
01110 would be a better example than 0110. I got confused by 01*0 for a moment (I thought * was a single "digit" placeholder). Not a big issue though. It's a good video overall.
That's because you might not have come across the Kleen closure and plus videos.
Any input symbol with a star signifies Kleen closure which means it can be replaced by Epsilon or occurrences of that input symbol any number of times.
correction : the transition from state C should have 'L' instead of 'R' as we only want the string to be accepted not the special symbol.
the input tape is unbounded on either side, and the input string is surrounded by blank spaces. therefore, you can assume that there are spaces all around it and explicitly writing the blank will not change the state of the tape vs not writing it.
this video is extremely misleading - it makes a distinction between the input string and the tape as if they are two separate things when in reality the input string is ON the tape. this is bound to confuse viewers. there's also absolutely no reason to print different symbols "x" and "y" on the tape if the machine is only ever traversing rightwards and not reading these symbols. changing what's being printed to the tape for no logical reason is again bound to cause confusion, and will have viewers unnecessarily questioning if there is some meaning behind it, when there just isn't. it would be more intuitive to just print blank symbols to the tape in all cases
Got it SIr (Salute Emoji)
In the morning my exam is there
Your explanation sometime isn't clear. You say that why to replace 0s and 1s with x and y and then you gave no explanation why you did that.
megan thee stallion
🤩
Such a boring explanation....
shut up