Register

CIL 2026 | System | Question: 39

ago • edited ago by
3 views
0 0 votes
CIL 2026 | System | Question-39

What makes a finite automaton deterministic?

  1. It can accept infinite input
  2. For each state and input, there is exactly one transition
  3. It has no start state
  4. It can have multiple transitions for the same input

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

0 0 votes
0 0 answers
7
7 views
Shubham Sharma 2 asked 4 days ago
7 views
CIL 2026 | System | Question: 1
What is the initial value of top in an empty stack implemented using an array?-0-11Depends on stack size
0 0 votes
0 0 answers
3
3 views
Shubham Sharma 2 asked 4 days ago
3 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
5
5 views
Shubham Sharma 2 asked 4 days ago
5 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...
0 0 votes
0 0 answers
5
5 views
Shubham Sharma 2 asked 4 days ago
5 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 fragmentatio...