Consider the following languages:
A = {w: |w| > k, where k is a constant integer}
B = {ε,0,1, 10, 001}
(The complement of A)
(The complement of B)
(True/False) A
is regular
(True/False) B
is regular
(True/False) is
regular
(True/False) is
regular
2. If A is regular, and A = A,
then B must be not regular. True or False
3. Given three languages A, B, C where . If both A and B are
regular, then C must be regular. True or False
Automata and...