An expression term builds a Büchi automaton that completes infinitely many blocks. Conversely, an accepting run revisits one final state infinitely often and can be cut into a prefix leading to that state followed by infinitely many non-empty return loops.