Question

The following is a list of statements about deterministic finite automata and regular languages.

Select all statements from below that are true.
1) The transition function s of a DFA may be continuous.
2) A valid DFA may have unreachable states.
3) Suppose languag L is regular. If a DFA M recognizes L, then for any string w ∈ ∑*, M will decide whether W ∈ L after exactly |w| transitions.
4) For a DFA M = (Q,∑,δ,qₛ,F), it may be the case that ∈ ∈ € .
5) Suppose there are two DFAs that recognize languages L₁ and L₂, respectively. It may be the case that L₁ ⋂ L₂ is regular, but it is also possible that this language is not regular.

Answer 1

Statement 2, 3, and 5 are true.

Step-by-step explanation:

The statements that are true are:

1. Statement 2: A valid DFA may have unreachable states.
2. Statement 3: If a DFA M recognizes a regular language L, then for any string w ∈ ∑*, M will decide whether w ∈ L after exactly |w| transitions.
3. Statement 5: It is possible that the intersection of two languages recognized by DFAs is regular, but it is also possible that it is not regular.