** 2.3b Show expressiveness of finite automata* Prove by construction of a DFA or NFA that...

Transcribed Image Text:

** 2.3b Show expressiveness of finite automata* Prove by construction of a DFA or NFA that for all regular languages L, L1, L2, 1. Reg(L) ⇒ (3A = NFA) L = L(A) their union is regular 2. 3. their intersection is regular 4. the reverse LR (strings in L, spelled backwards) is regular 5. their concatenation is always regular 6. L* is regular 7. Finite(L₁, L2) ⇒ Reg(L₁ L₂) ** 2.3b Show expressiveness of finite automata* Prove by construction of a DFA or NFA that for all regular languages L, L1, L2, 1. Reg(L) ⇒ (3A = NFA) L = L(A) their union is regular 2. 3. their intersection is regular 4. the reverse LR (strings in L, spelled backwards) is regular 5. their concatenation is always regular 6. L* is regular 7. Finite(L₁, L2) ⇒ Reg(L₁ L₂)

Answer rating: 100% (QA)

This question is asking for a demonstration of how finite automata which includes both deterministic finite automata DFA and nondeterministic finite automata NFA can express all regular languages and ... View the full answer