Article contents
Left-to-right regular languages and two-way restarting automata
Published online by Cambridge University Press: 24 April 2009
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2009
References
- 4
- Cited by