please answer my question?

Question

Construct the state diagram of the Turing machine that decides the following language:
{aibjck | i × j = k and i, j, k ≥ 1}

Answer 1

LOL ..yeah OK

Answer 2

This is not a research paper type question, just a standard (though quite tedious) automata theory question.

The answer is really long, but basically, what you want to do is:

start at left
move right past a
if you see an i, replace it with x
move right until you see a j, replace it with an x
move right until you hit a k or an x
move left
if you see a k replace it with an x (if not reject)
now move left past b until you hit x,
...
keep this up until you have crossed out a k for every j, then go back and uncross all of the j's and cross out the next i then repeat. Accept if you are finished crossing out i's j's and k's at the same time, reject if there are i's, j's, or k's remaining, but all the others are exhausted.

Hope that helps a little.

Answer 3

Good Luck!

That is a highly technical question that the average Internet user does not even understand. I am assuming that you are a college student who is working on a research paper. Do not make the mistake of listening to people over the Internet who might try to sell you a research paper. That is the kind of cheating that will get you suspended or expelled.

Answer 4

Well, I clicked on your plea because it was so simple and polite but I can't answer the rest of the question. It's Greek to me !! LOL

Answer 5

7ad yepost el take home exam 3ala el mala2 keda! looool