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

Transcribed Image Text:

The following is a list of statements about deterministic finite automata and regular languages. Select all statements from below that are true. Suppose language Lis regular. If a DFA M recognizes L, then for any string w e 2*, M will decide whether w E Lafter exactly w| transitions. O A valid DFA may have unreachable states. Suppose there are two DFAS that recognize languages L,and L2, respectively. It may be the case that Ln L2 is regular, but it is also possible that this language is not regular. O For a DFA M = (Q, E, 8, qs, F), it may be the case that e e E. O The transition function 8 of a DFA may be continuous. The following is a list of statements about deterministic finite automata and regular languages. Select all statements from below that are true. Suppose language Lis regular. If a DFA M recognizes L, then for any string w e 2*, M will decide whether w E Lafter exactly w| transitions. O A valid DFA may have unreachable states. Suppose there are two DFAS that recognize languages L,and L2, respectively. It may be the case that Ln L2 is regular, but it is also possible that this language is not regular. O For a DFA M = (Q, E, 8, qs, F), it may be the case that e e E. O The transition function 8 of a DFA may be continuous.