Consider a network using the pure ALOHA medium access control protocol, where each frame is of length 1,000 bits. The channel transmission rate is 1 Mbps (= 106 bits per second). The aggregate number of transmissions across all the nodes (in-cluding new frame transmissions and retransmitted frames due to collisions) is modelled as a Poisson process with a rate of 1,000 frames per second. Throughput is defined as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is  

Consider the following two statements about regular languages:

S₁: Every infinite regular language contains an undecidable language as a subset.

S₂: Every finite language is regular.

Which one of the following choices is correct?

Consider the following language.

L = { w ∈ {0, 1}* | w ends with the substring 011}

Which one of the following deterministic finite automata accepts L?

Consider the following language.

L = {x $$ \in $$ {a, b}* | number of a’s in x is divisible by 2 but not divisible by 3}

The minimum number of states in a DFA that accepts L is ______.