On lexicalized well-behaved restarting automata that are monotone

Authors:
Friedrich Otto;Martin Plátek;František Mráz
Affiliations:
Fachbereich Elektrotechnik, Informatik, Universität Kassel, Kassel, Germany;Charles University, Faculty of Mathematics and Physics, Department of Computer Science, Praha 1, Czech Republic;Charles University, Faculty of Mathematics and Physics, Department of Computer Science, Praha 1, Czech Republic
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 8
Cited 0

Church-Rosser Languages vs. UCFL

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Two-Way Restarting Automata and J-Monotonicity

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
On determinism versus nondeterminism for restarting automata

Information and Computation
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages

Theoretical Computer Science
LR-regular grammars-an extension of LR(k) grammars

Journal of Computer and System Sciences
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Hierarchical relaxations of the correctness preserving property for restarting automata

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Quantified Score

Hi-index	0.02

Visualization

Abstract

We introduce lexicalized well-behaved restarting automata as a model of the gradual lexicalized syntactic disambiguation of natural languages. This model presents a non-correctness preserving counterpart to the (correctness preserving) models of analysis by reduction of natural languages. We study two types of gradual relaxations of the correctness preserving property for monotone automata of this type. They lead to two infinite hierarchies of language classes. The basic levels of these hierarchies coincide with the class LRR of left-to-right regular languages, and the hierarchies exhaust the class of context-free languages.