229 views
0 votes
0 votes
Time taken by one tape TM to simulate n moves of k-tape TM is

1) O(n)

2) O(n^k)

3) O(n^2)

4) None of the above

1 Answer

Best answer
0 votes
0 votes

 Option A. Its O(n)

Let's take a Language (L) = {a^nb^n}

a a a a aa a a a a ------n
b b b b b b b b b ------n

In Standard Turing Machine we do comparison for 1st 'a' to 1st 'b'  via R/W header points to the tape, then we have to cross through n cells,

So for 'n' comparison for (a,b), require n*n cells = O(n^2).

But when we use Multi 2-Tape Turing Machine we require to R/W header points to the tape,

So first we copy a^nb^n from 1-tape to 2-tape through scanning the cells, it takes O(n) time to copy the input .

Now we easily compare with an appropriate header in both Tape 1 and Tape 2. in O(n) time .

So total time takes = Copy time + Comparsion time = O(n) +O(n) = O(n).

 

selected by

Related questions

0 votes
0 votes
2 answers
2
Balaji Jegan asked Oct 23, 2018
532 views
A man alternately tosses a coin and throws a dice, beginning with the coin. Then probability that he will get a head before he gets a 5 or 6 on dice is1) 1/42) 3/43) 4/54...
0 votes
0 votes
1 answer
3
Balaji Jegan asked Oct 23, 2018
280 views
If mean = (3 median – mode)x, then value of x is1) 12) 23) 1/24) 3/2
0 votes
0 votes
0 answers
4
Balaji Jegan asked Oct 23, 2018
989 views
Minimum Hamming distance method is used for correction of1) syntactic errors2) semantic errors3) algorithmic errors4) transcription errors