Question

(4) Consider the Deterministic Finite Automata , A = (QA, ?A, ?A, q0A, FA) and B = (QB, ?B, ?B , q0B, FB) with QA ? QB = ? , ?A ? ?B = ? where ? stands for the null set. Let LA ? ?A* and LB ? ?B* be the languages accepted by A and B respectively and define the interleaved language: LA || LB := {s ? (?A ? ?B)* | s ? A ? LA and s ? B ? LB } where s ? A and s ? B stand for the projection of s on ?A and ?B obtained by erasing all the symbols of s in ?B and ?A respectively. (a) Define the interleaving product A || B of A and B as a DFA that accepts the language LA || LB (b) Compute a DFA that accepts the language L = (0.1)* || (a.b)*

          (4) Consider the Deterministic Finite Automata ,
A = (QA, ?A, ?A, q0A, FA) and B = (QB, ?B, ?B , q0B, FB) with
QA ? QB = ? , ?A ? ?B = ? where ? stands for the null set.
Let LA ? ?A* and LB ? ?B* be the languages accepted by A and B respectively and define the interleaved language:
LA || LB := {s ? (?A ? ?B)* | s ? A ? LA and s ? B ? LB }
where s ? A and s ? B stand for the projection of s on ?A and ?B obtained by erasing all the symbols of s in ?B and ?A respectively.
(a) Define the interleaving product A || B of A and B as a DFA that accepts the language LA || LB
(b) Compute a DFA that accepts the language L = (0.1)* || (a.b)*

(4) Consider the Deterministic Finite Automata ,
A = (QA, ?A, ?A, q0A, FA) and B = (QB, ?B, ?B , q0B, FB) with
QA ? QB = ? , ?A ? ?B = ? where ? stands for the null set.
Let LA ? ?A* and LB ? ?B* be the languages accepted by A and B respectively and define the interleaved language:
LA || LB := s ? (?A ? ?B)* | s ? A ? LA and s ? B ? LB
where s ? A and s ? B stand for the projection of s on ?A and ?B obtained by erasing all the symbols of s in ?B and ?A respectively.
(a) Define the interleaving product A || B of A and B as a DFA that accepts the language LA || LB
(b) Compute a DFA that accepts the language L = (0.1)* || (a.b)*

Added by Jose Maria B.

Question

Please give Ace some feedback