LEFT-TO-RIGHT REGULAR LANGUAGESAND TWO-WAY RESTARTING AUTOMATA

It is shown that the class of left-to-right regular languagescoincides with the class of languages that are accepted by monotonedeterministic RL-automata, in this way establishing a close correspondencebetween a classical parsing algorithm and a certain restrictedtype of analysis by reduction