Register

CIL 2026 | System | Question: 5

• edited by
22 views
0 0 votes

The minimized Deterministic Finite State Machine (DFSM) in theory of computation for a language always has:

  1. Equal number of final and non-final states
  2. Exactly one final state
  3. The minimum number of states possible for that language
  4. The same number of states as the NFA

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · CIL 2026 | System | ...Next → · CIL 2026 | System | ...
← Previous in category · CIL 2026 | System | ...Next in category → · CIL 2026 | System | ...
Position:
Show:

Related questions

1 1 vote
0 0 answers
26
26 views
Shubham Sharma 2 asked Sep 15
26 views
CIL 2026 | System | Question: 1
What is the initial value of top in an empty stack implemented using an array?$0$$-1$$1$Depends on stack size
0 0 votes
0 0 answers
16
16 views
Shubham Sharma 2 asked Sep 15
16 views
CIL 2026 | System | Question: 2
A banking transaction commits successfully, but a system crash occurs immediately afterward. Which mechanism ensures durability?LockingPartial commitTransaction isolation...
0 0 votes
0 0 answers
19
19 views
Shubham Sharma 2 asked Sep 15
19 views
CIL 2026 | System | Question: 3
Consider a finite state transducer (FST) with $Q=\left\{q_{0}, q_{1}\right\}, \Sigma=\{0,1\}, \Gamma=\{a, b$, $\mathrm{c}\}$, initial state $\mathrm{q}_{0}$, and the foll...
1 1 vote
0 0 answers
20
20 views
Shubham Sharma 2 asked Sep 15
20 views
CIL 2026 | System | Question: 4
In a memory system with fixed-sized partitions, each holding one process (as in IBM OS$/360$ MFT).Which statement is correct?Multiprogramming limited; internal fragmentat...