Problem 5. Write a corresponding CFG for the following languages where E = {a, b}. a) L = {a"wbN:w€ (a, b}",N 2 0} b) L= (wb:w e (a, b}') c) L= (all strings in (a,b}* where the number of a's is odd) %3D Convert the following Finite Automata to Regular Grammar:
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
Step by step
Solved in 2 steps
