edited by
8,284 views
8 votes
8 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
edited by

2 Answers

Best answer
20 votes
20 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 votes
10 votes

a) without rewinding capabiltiy and unidirectional tape movement.

reshown by
Answer:

Related questions

18 votes
18 votes
8 answers
2
Anu asked Jul 4, 2016
17,384 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
10 votes
10 votes
1 answer
3
34 votes
34 votes
7 answers
4
Kathleen asked Sep 22, 2014
20,200 views
$$S \to aSa \mid bSb\mid a\mid b$$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings t...