Back to Search Start Over

LEFT-TO-RIGHT REGULAR LANGUAGES AND TWO-WAY RESTARTING AUTOMATA.

Authors :
OTTO, FRIEDRICH
Source :
RAIRO - Theoretical Informatics & Applications; 2009, Vol. 43 Issue 3, p653-565, 13p
Publication Year :
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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
LANGUAGE & languages
PARSING (Grammar)
COMPUTER algorithms
COMBINATION (Linguistics)
LINGUISTIC analysis
MACHINE theory
LINGUISTICS
PHILOLOGY
COMPUTER programming

Details

Language :
English
ISSN :
28047346
Volume :
43
Issue :
3
Database :
Complementary Index
Journal :
RAIRO - Theoretical Informatics & Applications
Publication Type :
Academic Journal
Accession number :
41563170
Full Text :
https://doi.org/10.1051/ita/2009013
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details