Left-to-right regular languages and two-way restarting automata
Friedrich Otto · RAIRO - Theoretical Informatics and Applications · 2009
It is shown that the class of left-to-right regular languages coincides with the class of languages that are accepted by monotone deterministic RL-automata, in this way establishing a close correspondence between a classical parsing algorithm and a certain restricted type of analysis by reduction.