Home /
Expert Answers /
Computer Science /
automata-theory-give-a-formal-description-of-bar-l-where-sigma-a-b-and-l-pa263

L is the set of all strings consisting of only the symbols a and b, including the empty string ?. Formally, L = { w | w ? ?* and w only contains the symbols a and b } Explanation: L is the collection of all strings,