Register

finite autometa
closed

• closed by
401 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

692
views
1 answers
0 votes
Gurdeep Saini asked Jan 11, 2019
692 views
theory of autometa
let M be a finite autometa .let M' denote the machine obtained by interchanging the final and non final stateL(M) U L(M') =sigma*L(M) $\cap$ L(M') =$\Phi$how many stateme...
User Avatar
918
views
1 answers
1 votes
Hira Thakur asked Dec 13, 2016
918 views
finite autometa
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
464
views
1 answers
1 votes
stillhere asked Sep 10, 2023
464 views
Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts th...
User Avatar
Link Copied!