1. Construct the product table for the language ? = ???∗ and the
language ?, which contains all strings of ?’s and ?’s whose length
is a multiple of 3. (Use state names r0, r1, ... and s0,
s1...).
a. Which states from your product table must accept for ? ∪
??
b. Which states from your product table must accept for ? ∩
??
c. Which states from your product table must accept for ? –
??
d. Which states from your product table must accept for ?
−??
e. Which states from your product table must accept for ? ⊖??
Get Answers For Free
Most questions answered within 1 hours.