| Issue |
RAIRO-Theor. Inf. Appl.
Volume 43, Number 3, July-September 2009
|
|
|---|---|---|
| Page(s) | 653 - 665 | |
| DOI | https://doi.org/10.1051/ita/2009013 | |
| Published online | 24 April 2009 | |
Left-to-right regular languages and two-way restarting automata
Fachbereich Elektrotechnik/Informatik, Universität Kassel,
34109 Kassel, Germany; otto@theory.informatik.uni-kassel.de
Received:
19
December
2007
Accepted:
5
March
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.
Mathematics Subject Classification: 68Q45
Key words: Left-to-right regular grammar / two-way restarting automaton / monotonicity.
© EDP Sciences, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.