Register

finite autometa
closed

• closed by
397 views
0 votes
0 votes
closed as a duplicate of: ISRO2014-2
the number of state of the FSM required to simulate the behavior of a computer with a memory capable of storing m words each of length is n bit is:

1) m*2^n

2)2^m-n

3)2^mn

4)2^m+n
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Hira Thakur asked Dec 13, 2016
908 views
finite autometa
for a FA of n state the maximum length of string that must be consider to distinguish two states is: a:n b:n-1 c:n-2 d:none
for a FA of n state the maximum length of string that must be consider to distinguish two states is:a:nb:n-1c:n-2d:none
User Avatar
Link Copied!