Bihar STET – TOC Practice Test | Set 3

Questions 11-15 of 100

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

Question 11

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

What is the length of the output string generated by a Moore machine when processing an input string of length n?

Answers for question 11

Question 12

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

What is the length of the output string generated by a Mealy machine when processing an input string of length n?

Answers for question 12

Question 13

MCQ · Single Correct 1 mark

What is the equivalent regular expression for the DFA transition equations: q0 = a q1 + b q0 + $\epsilon , q1 = a q0 + b q1$?

Answers for question 13

Question 14

MCQ · Single Correct 1 mark

Which algorithm computes the transitive closure of state accessibility in a finite automaton to determine reachability?

Answers for question 14

Question 15

MCQ · Single Correct 1 mark

What is a 'Sub-automaton' of a Finite Automaton $M = (Q$, $\Sigma , \delta , q0, F$)?

Answers for question 15
Scroll to Top