CAT 2024 Last Batch 🧑🎓 Starts on Monday (22nd July). Enroll now
Edit MetaData
The number of states required by a Finite State Machine, to simulate the behaviour of a computer with a memory capable of storing ‘m’ words, with each word being ‘n’ bits long is
$$m \times 2^n$$
$$2^{m + n}$$
$$2^{mn}$$
$$m + n$$
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Quick, Easy and Effective Revision
By proceeding you agree to create your account
Free CAT Formulae PDF will be sent to your email address soon !!!