1)Are there languages for which s L is the complement of L?
For any language L over an alphabet , the complement of L is L = x * cfw_ | x L
2) Find grammars for = cfw_a, b that generate the following languages:
The focus of this course is on three central areas of CS Theory: Automata,
Computability, and Complexity. They are linked by the question:
What are the fundamental capabilities and limitations of computers?
Automata Theory: deals with the def
Note: Not sure how to type subscript letters yet/negations
Basis: If S1=cfw_, S2=cfw_, then S1 U S2=cfw_ the inequality holds because the cardinality of the union is less
than or equal to m+n=0+0=0.