How to prove that this defined language is regular?
Try proving it for $\alpha = 1/2$ first.  Construct a non-deterministic automaton that recognizes $L_\alpha$.  Before you start reading in the string $w$, guess something about where you will be in the future.  What would you like to guess?  What would help you?