Aufsatz in einer Fachzeitschrift
Left-to-right regular languages and two-way restarting automata
Details zur Publikation
Autor(inn)en: | Otto, F. |
Publikationsjahr: | 2009 |
Zeitschrift: | RAIRO: Theoretical Informatics and Applications |
Seitenbereich: | 653-665 |
Jahrgang/Band : | 43 |
Erste Seite: | 653 |
Letzte Seite: | 665 |
ISSN: | 0988-3754 |
eISSN: | 1290-385X |
DOI-Link der Erstveröffentlichung: |
Zusammenfassung, 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.
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.
