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

@sofilove...20

Жыл бұрын

:))

@323-sanikar.jagtap2

7 ай бұрын

😂Yaah.. they take 3 classes to explain the same concept...

@AMemekageV100

5 ай бұрын

I read it as cm punk lol

Your channel is a life saver for every engineering students.. Love your videos, soooo good methods of explaining... SALUTE TO NESO ACADEMY...

@phdcarshow232

5 жыл бұрын

Ya it's very helpful Love you

@sent4444

3 жыл бұрын

But... isn't this video is for scientist?

@spoorthishobhitha1764

2 жыл бұрын

S 🙉👌

@zackcarl7861

Жыл бұрын

@@sent4444 what no ,all this is indian undergrad CS engineering sylabus for 3 or 4th semester students

@tszkoon4269

Жыл бұрын

SALUTE TO NESO ACADEMY...

holy crap dude.......I never knew ToC could be understood so easily........You have my respect ^_^

1st yay. You are heaven sent. God bless your brains and your time to teach us. Thank you for making tutorials.

Such a life saver you are. Teaching with the basic concepts easily. 🌟😌

Thank you soo much Sir, best i never had seen classes... Superb tq once again.

Really well explained. Thank you!

Very clear explanation. Thank you!!

The only explanation of turing machine on youtube that makes sense ❤️

Godly Explanation! Thanks

Very awesomely explained

wonderful explanation of a complex topic

Thank you..very well explained

Exceptional Teaching, bravo!

pls also add examples on conversion of cfg to PDA and vice versa. do reply.

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!

Just need a clearification sir. Should we add one blank or infinite blank in the Tape for the input string 0110?

It's very good for understanding

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.

good example thanks

I have one question sir, how can we design a TM such that (0^n 10^3n) how do we solve this?

Well explained...

Soooooo good explains for us ,, very very thank you

@tszkoon4269

Жыл бұрын

very very thank you

Well explained. Thank you.

from the future and it still saving me

God bless you Sir!!!

Why we want to differ the tape symbol and the input symbol ?

Good for understanding

Does turing machine accept ∅? If no, then either ∅ is regular language or turing machine doesnot accept regular language?

you are awesome !!

My prof for this works at lockheed and tells us we will never use it... but thanks!

Thanks Sir JI😊😊

I wish all teachers taught like you

@SattiSanthoshReddy

Жыл бұрын

if u listen in class carefully u will understand

@AmanSingh-om1zu

Жыл бұрын

@@SattiSanthoshReddy Then why are you here?

@SattiSanthoshReddy

Жыл бұрын

@@AmanSingh-om1zu i am not a student

a^nb^nc^m, n, m>=1, sir could u solve this question..

Dude u r the best 😘

the empty string is included in 1*, hence I believe blank should be accepted as well in the B state?

@sammyawad6319

4 жыл бұрын

@Prathmesh Tiwari SO a 1 is not needed to be accepted.

@nishantnaik9543

2 жыл бұрын

blank is not a symbol in Sigma so can't accept it

life saver💙💙

Very well explained but my teacher always find mistakes from this method 🤷🏻‍♀️🤷🏻‍♀️🤦‍♀️🤦‍♀️

Turing machine uses 0.0001% of its power Thanos dies

@tszkoon4269

Жыл бұрын

LOL - us turing machine folks think Marvel Movies are epic.

merci beaucoup

Sir can u plzz make video on complexity theory

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??

@desertsage6825

6 жыл бұрын

Should go to the reject state, as he said in the final few minutes of the video, since there is no transition drawn.

@ghulamadil3418

6 жыл бұрын

it will go to accept state Mrs.Just laugh

@AsirSCicek

6 жыл бұрын

1* can be null.It will be accept by that reason.

@scoutdude

5 жыл бұрын

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 :^)

how to make turing machine for double word over alphabet a,b ????

Thankyou sir

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

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.

@marxman1010

2 жыл бұрын

Also blank is not a input alphabet,. The example is confusing.

@AymenHitta

2 жыл бұрын

but 00 is also a string the form 01*0

@mbesh6377

2 жыл бұрын

00 is part of this language so it's correct.

But how did you design that machine?

what if you get a 0 at state B right after getting a 0 in state A. Shouldn't that reject the string ?

@legend7890

3 жыл бұрын

it will accept because 1* means 0 or more 1's

My Teacher uses this channel to teach us

Input symbol doesn't consist blank symbol right

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

@shindeshubhamm

4 жыл бұрын

1* also includes ϵ. So, 00 is also acceptable for 01*0.

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.

@sent4444

3 жыл бұрын

State -> A B C 'Accept' Tape -> x x Blank 'Blank' Result is accept '' mean current state/current head pointer

@schmud68

3 жыл бұрын

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.

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.

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

Nice

Thank you so much 😁

Sir give lecture no in title of video plz it's confusing which 2 watch frist Hope u notice

Nice tq sir

Sir, is your course enough for the university examinations ??

@tejasri5313

5 жыл бұрын

Is this enough for gate

@pup_lover

5 жыл бұрын

@@tejasri5313 of course not!!

IS IT CORRECT IF THE TM TAKING EVEN 00? LIKE ACCEPT?

@Arghandevol

3 жыл бұрын

BUT THE L SAYING THAT IT SHOULD BE 010 OR 01111110... BUT NOT 00

what if input is 00 only.

Is it necessary to draw reject state

@schmud68

3 жыл бұрын

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).

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

So the blank state is not included in 1*? Thought it was

i love you

Will the string 00 is accepted??

@msd129

2 жыл бұрын

Yes

@tszkoon4269

Жыл бұрын

no

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

@aishwaryasureshkumar1707

5 жыл бұрын

It is correct as * means zero or more times

isnt 1* the kleene closure? so shouldnt it also allow the string "00"?

but why did you put the rehect , there is no meed

@anudeepakula1101

6 жыл бұрын

coz this turing machine is a deterministic one

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.

@shadowslayer2248

9 ай бұрын

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.

why you write x not write 0

i don't know why he don't show us how does he draw it in the video

my strange addiction

Blank symbol does not belong to sigma, the input alphabet. See previous video.

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

@eccedentesiast4647

11 ай бұрын

My teacher says the same thing. Same doubt after 4 yrs,,, hehe ~

isn’t this a finite state machine 🤔

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.

@OskarAriaAttar

7 ай бұрын

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.

Is it possible to get like from NESO in 2021?

@tszkoon4269

Жыл бұрын

no

what if the string is 0010????

@sent4444

3 жыл бұрын

State -> A B C 'Reject' Tape -> x x '1' 0 Result is reject

Rejected state act as dead state 🤔

What about 01100

@betteryetshark

6 жыл бұрын

Wouldn't it end up in the reject state since adding the extra 0 would not be in the language 01*0?

@frostbite585

6 жыл бұрын

It would definitely reject. It even shows a transition there for that case.

@kyy6150

6 жыл бұрын

yes you need to expand the algorithm with logical solution like how he suggested, so basically try works too

What happened if we get a 0010.

@rohanchoudhary2277

5 жыл бұрын

amity se ho ka tau

@akashkumar-sp5iy

5 жыл бұрын

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

@tanujdeepsingh2572

6 жыл бұрын

i think 1* means any no. of 1s which inludes 0 no. of 1s as well and hence it will be accepted

@tatsolok24

6 жыл бұрын

1* means that there can be no instances of 1.

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

@dvalley56

2 жыл бұрын

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

@tszkoon4269

Жыл бұрын

🤩

Such a boring explanation....

@tszkoon4269

Жыл бұрын

shut up