Question

Find dfa’s that accept the following languages:

a. L = L(ab*a * ) ∪ L ((ab) * ba).
b. L = L(ab*a * ) ∩ L((b) * ab).

Answer 1

To find DFA that accepts the given languages, convert regular expressions to DFA using subset construction algorithm.

Step-by-step explanation:

To find DFA (Deterministic Finite Automaton) that accepts the given languages, we need to consider the regular expressions for each language and convert them into a DFA. Let's solve each part of the question:

a. L = L(ab*a * ) ∪ L ((ab) * ba)

To find a DFA for this language, we first need to construct an NFA (Non-deterministic Finite Automaton) for each regular expression, then convert them into a DFA using the subset construction algorithm. Once we have the DFAs for both regular expressions, we can take their union to obtain the final DFA that accepts the language.