Register

finite autometa
closed

• closed by
547 views
0 0 votes
closed as a duplicate of: ISRO CSE 2014 | Question: 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
Voting & Accepting an answer helps improve the community
← Previous · outputNext → · #TOC Grammar Doubt
← Previous in category · regular expressionNext in category → · #TOC Grammar Doubt
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.4k
1.4k views
Gurdeep Saini asked Jan 11, 2019
1,362 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...
1 1 vote
1 1 answer
1.2k
1.2k views
Hira Thakur asked Dec 13, 2016
1,156 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
2 2 votes
2 2 answers
326
326 views
Vyshakh_Nambiar asked Dec 2, 2025
326 views
Theory of Computation, Finite Automaton
If the initial state is final then Option C should be correct right?the solution was option D, and it mention that ε ∉ L(M). Why doesn't ε belong to L(M).