Ask Question
29 October, 01:05

If a ≤m b and b is regular, does that imply that a is a regular language? why or why not?

+4
Answers (1)
  1. 29 October, 02:59
    0
    Answer: No. For example, define the languages A = n ≥ 0 and B = {1}, both over the alphabet Σ = {0, 1}. Define the function f : Σ∗ → Σ∗ as
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “If a ≤m b and b is regular, does that imply that a is a regular language? why or why not? ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers