Bihar STET – TOC Practice Test | Set 3

Questions 16-20 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 16

MCQ · Single Correct 1 mark

If L is a regular language, is the set Init(L) = { u | ∃ v ∈ $\Sigma * such$ that uv ∈ L } Regular?

Answers for question 16

Question 17

MCQ · Single Correct 1 mark

If L is a regular language, is the language Tail(L) = { v | ∃ u ∈ $\Sigma * such$ that uv ∈ L } Regular?

Answers for question 17

Question 18

MCQ · Single Correct 1 mark

What is the state complexity bound for converting a non-deterministic finite automaton with $\epsilon -transitions (\epsilon -NFA)$ to a DFA?

Answers for question 18

Question 19

MCQ · Single Correct 1 mark

In automata theory, two states p and q in a DFA are defined to be 'Equivalent' (p ≡ q) if -

Answers for question 19

Question 20

MCQ · Single Correct 1 mark

What is the time complexity of Hopcroft's DFA minimization algorithm for a DFA with n states and alphabet size k?

Answers for question 20
Scroll to Top