0 votes
4
The set of all recursively enumerable languages is:closed under complementationclosed under intersectiona subset of the set of all recursive languagesan uncountable set
0 votes
8
0 votes
9
The application of finite automata include:-a)Lexical Analyzerb)Text Editorc)Operating Systemd)All of the above
0 votes
10
In the slow start phase of the TCP congestion algorithm, the size of the congestion window:does not increaseincrease linearlyincreases quadraticallyincreases exponentiall...
0 votes
11
0 votes
13
What it the number of tokens in the following line?printf("%d numbers.", &x);
0 votes
16
0 votes
19
Which machine is equally powerful in both deterministic and non-deterministic form?Push Down AutomataTuring machineLinear Bounded AutomataNone of the options
0 votes
23
Context free languages are closed underunion, intersectionunion, kleene closureintersection, complementcomplement, kleene closure
0 votes
29
Which of the following is true?Every subset of a regular set is regularEvery finite subset of non-regular set is regularThe union of two non regular set is not regularInf...