Using set builder notation, what is the Language described by this NFA? At first I thought it would be
L = { 1^n (01)^m 1^o | n,m,o >= 0} But then the string 101111101, which is accepted by this NFA is not accepted by the language I just described.
Perhaps you can do it in set-builder notation neatly as follows:
L = {w0 w1 w2 … wk | k >= 0, wi in {1, 01}}
This doesn't use disjunction, union, intersection or Kleene star explicitly.