edited by
11,479 views
9 9 votes

AN FSM(finite state machine) can be considered to be a turing machine of finite tape length

  1. without rewinding capability and unidirectional tape movement
  2. rewinding capability and unidirectional tape movement
  3. without rewinding capability and bidirectional tape movement
  4. rewinding capability and bidirectional tape movement

2 Answers

Best answer
24 24 votes

Ans A

without rewinding capability and unidirectional tape movement.

Rewinding: Process first element in input ...go to last element and process it ...come back to starting of input ..... This is done by Turing machine.. FSM process input from left to right , one by one. It cannot rewind!

selected by
10 10 votes

a) without rewinding capabiltiy and unidirectional tape movement.

reshown by
Answer:
Position:
Show:

Related questions

20 20 votes
9 answers 9 answers
23.1k
23.1k views
Anu asked Jul 4, 2016
23,131 views
What is the highest type number that can be assigned to the following grammar?$$S\to Aa,A\to Ba,B \to abc$$Type 0Type 1Type 2Type 3
11 11 votes
1 answers 1 answer
8.3k
8.3k views
Desert_Warrior asked Jul 3, 2016
8,341 views
Let $L=\{w \in (0+1)^* \mid w \text{ has even number of 1's}\}$, i.e. $L$ is the set of all bit strings with even number of 1's. Which one of the regular expression below...
8 8 votes
2 answers 2 answers
4.7k
4.7k views
Arjun asked Jul 6, 2016
4,747 views
A simple two-pass assembler does which of the following in the first pass:Checks to see if the instructions are legal in the current assembly modeIt allocates space for t...
8 8 votes
3 answers 3 answers
12.5k
12.5k views
Arjun asked Jul 6, 2016
12,476 views
At a particular time of computation the value of a counting semaphore is 7. Then 20 $P$ operations and $x$ $V$ operations were completed on this semaphore. If the new val...