Design View:

By JFLAP Software

By JFLAP Software

Concept :

aaabbb

Case1: XaaYbb

Case2:XXaYYb

Case3:XXXYYY

Case 1:

Read first 'a' and replace it by 'X'

Then read first 'b' and replace it as 'Y'

What i am doing is .....Meaning of a^n b^n is " Equal no: of a's must followed by equal no: of b's "

In Case 1 : I read first 'a' and First 'b'.

Before reading Second 'b'....Should read Second 'a' ....

Then continue the steps.....Finally 'B' reads....Machine will stop...

Transitions concept will continue ......

please tell me the turing machine for a^n+1 b^n

ReplyDeletemake one state before q0(start state). and that state transited to q0 with a, B, R.

Deleteis it problem solve or not?

plz turing machine for a^nb^n+1

DeleteV helpful .Thanks alot

ReplyDeletethank you MR.ARUN ANOOP ou are real gentleman.

ReplyDeletehttp://cs-09-506-toc.blogspot.in/2016/08/for-tution-theory-of-computation-please.html

ReplyDelete