Comp Science: Automata Language and Computations

he following languages (language Problem 2: (30 pts) Find a context free grammar for each of t can also be represented by basic operations of other languages) (7 pts) L-a"b": n m-1 } (7 pts) L-{a"b"c": k-n + m}