Math, asked by antasd6971, 1 year ago

If a is reducible to b and b is regular. Prove that a is regular language

Answers

Answered by tawaseem
0

B is derived from A.

B is regular.

Then,a regular language is derived from another regular language.

Therefore,

A is regular.

Similar questions