If a is reducible to b and b is regular. Prove that a is regular language
Answers
Answered by
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
Hindi,
7 months ago
Social Sciences,
7 months ago
Math,
1 year ago
Math,
1 year ago
Environmental Sciences,
1 year ago