Question

Find the equivalent classes of the relation R_L for the L defined in 1.46 part (a). Recall that for any language L, not necessarily a regular language, we defined the equivalence relation R_L on
Σ* as follows: xR_Ly iff ∀z ∈ Σ* , [xz ∈ L ⇐⇒ yz ∈ L].

1.46) Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and complement.

a. {0ⁿ1^m0ⁿ | m,n ≥ 0}

Answer 1

preof asa pampiog imma ) New, divide into χ9t o lo lio fr al i' Should belenye e L corp)の le九Ce

contant n Cahese valve deperts ayon ly th o L and jen e con te broten into s Jeut Then fei all 120, the string χу"z also belo nes tol,