1
Question
Consider the regular expression (0+1) (0+1)_n times. The minimum state finite automation that recognizes the language represented by this regular expression contains
Consider the regular expression (0+1) (0+1)_n times. The minimum state finite automation that recognizes the language represented by this regular expression contains
Open in App
Solution
The correct option is D n + 1 states
The minimum state finite automation that recognizes the language represented by regular expression (0+1) (0+1) ...n times is n + 1.
This language contains strings with exactly length n.
(n+1) states are required to count length upto n. No trap state is required since we are making minimal FA, not minimal DFA.
For example, for n = 2 the design is shown below.
The minimum state finite automation that recognizes the language represented by regular expression (0+1) (0+1) ...n times is n + 1.
This language contains strings with exactly length n.
(n+1) states are required to count length upto n. No trap state is required since we are making minimal FA, not minimal DFA.
For example, for n = 2 the design is shown below.
Suggest Corrections
1
Join BYJU'S Learning Program
Join BYJU'S Learning Program
