Proving language as regular

60 Views Asked by At

Suppose that A and B are languages such that A o B is regular. Suppose that B is regular. Prove or disprove that A is regular.

I am having a tough time with questions relating to proving a language as regular. Please help.

1

There are 1 best solutions below

0
On

I'll give you a strong hint:

Think what happens when a language $L$ is concatenated with $\Sigma^*$.