In a Deterministic Finite Automaton (DFA), for every state and input symbol, how many next-state transitions are defined?
A DFA requires a deterministic transition function $\delta$: Q \times \Sigma → Q, meaning for every state and input symbol pair, there is exactly one next state.
[BPSC TRE 1.0 Class 11-12 PYQ] Which of the following formal language models has the lowest computational power in the Chomsky Hierarchy?
Finite Automata recognize Type-3 (Regular) languages, which occupy the innermost level with the least computational power in the Chomsky Hierarchy.
[BPSC TRE 2.0 Class 11-12 PYQ] Which of the following operations preserves the regularity of languages?
Regular languages are closed under union, concatenation, and intersection. Since more than one of the listed operations preserves regularity, the correct answer is 'More than one of the above'.
[BPSC TRE 2.0 Class 11-12 PYQ] If language L is regular, then its complement L' = \Sigma * - L is:
Regular languages are closed under complementation. The complement DFA is constructed simply by swapping accepting and non-accepting states.
Which of the following operation(s) preserve the regularity of a language?
Regular languages are closed under Union, Intersection, Complement, Set Difference, Concatenation, Reversal, Homomorphism, and Kleene Star.