(F(o(r(m(a(l))))) (L(a(n(g(u(a(g(e))))))))

All the definitions and concepts of formal languages make sense to me except for one: Kleene star. I did not follow at all every example involving kleene stars during the lecture, which was really frustrating. It is, nonetheless, not a hard concept to understand. The intricate part is that the kleene star of any language includes the empty string. For example, the kleene star of an EMPTY language is the empty string. This may seem a little bizarre at first, but a little glance at the definition of kleene star sure will clear any confusions. As a result, ((0+1)(0+1))*(0+1) denotes all binary strings of odd length and 1*0(1*01*0)* denotes all strings with odd number of zeros ending with a zero.