Ask Question
23 February, 07:07

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

+2
Answers (1)
  1. 23 February, 08:33
    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?
Find 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 and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers