Bihar STET – TOC Practice Test | Set 2

Questions 1-5 of 100

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

Question 1

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-I) PYQ

In the Myhill-Nerode Theorem, two strings x and y are defined to be equivalent with respect to a language L (x $R_L$ y) if -

Answers for question 1

Question 2

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.06.2024 (Shift-I) PYQ

What does the 'Index' of the Myhill-Nerode equivalence relation $R_L$ represent for a regular language L?

Answers for question 2

Question 3

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 03.11.2025 (Shift-I) PYQ

In the Table-Filling Algorithm (Marking Algorithm) for DFA minimization, two states p and q are distinguished in the base step if -

Answers for question 3

Question 4

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 04.11.2025 PYQ

In the Table-Filling DFA minimization algorithm, when is a state pair (p, q) marked as distinguishable in an inductive step on input symbol 'a'?

Answers for question 4

Question 5

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 2020 PYQ

According to the Pumping Lemma for Regular Languages, for any regular language L with pumping length p, every string w ∈ L with |w| $\ge p can be split$ into $w = xyz satisfying$ which THREE conditions?

Answers for question 5
Scroll to Top