Recent content by smith92

  1. S

    When Context Free is actually Regular

    I do not understand. You want to decide if context free language s a subset of any regular language? It always happens. If L is CFL over alphabet A, then A* is regular and L is subset of A*.
  2. S

    Show that language over unary alphabet is context free iff is regular.

    Let L be language over unary alphabet {0}. Show that L is context free iff L is regular. Could someone give me a hint how to solve this problem? I solved similar problem: Show that L* is regular, but I still don't have idea how to solve previous. Second problem could be solved in this way (e...