I am very new to finite automata, and I came across an issue in my professors lecture slides which I think is wrong, and I'd wonder if any of you could confirm: Alphabet: {1}
Surely the accepting language is not this, and is rather
{x: x (iselementof) StarClosureAlphabet and the length of x is even}
If this is incorrect and you can explain, please do, I really can't understand this.