emilyswinge670 emilyswinge670
  • 29-08-2017
  • Computers and Technology
contestada

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

Respuesta :

collincross collincross
  • 01-09-2017
Answer: No. For example, define the languages A = { 0 n1 n | n ≥ 0 } and B = {1}, both over the alphabet Σ = {0, 1}. Define the function f : Σ∗ → Σ∗ as
Answer Link

Otras preguntas

In 1834, what department had the highest population in Texas?
what beliefs and values bring Americans together as a nation
how do you write" Joe watched television all day" in sensory detail?
Hoy en día los gauchos viven en las ciudades de Uruguay.
Someone who follows a vegan diet is most likely to have a deficiency of which nutrient?
what north america resources were important to the spanish, the french, and the english
why are the freezing points of water and the melting point the same
Which southern colony is labeled F?
Evaluate the expression for r = 2 and t = 7. 3(r2 + t) - r2
In thinking about her future career as a counselor, taisha thinks she will be most concerned with her client's subjective experience and biological processes. s