@inproceedings{OPM10,
  author = {Otto, Friedrich and Plátek, Martin and Mráz, František},
  title = {On Lexicalized Well-Behaved Restarting Automata That Are Monotone},
  booktitle = {Developments in Language Theory},
  series = {Lecture Notes in Computer Science},
  editor = {Gao, Yuan and Lu, Hanlin and Seki, Shinnosuke and Yu, Sheng},
  publisher = {Springer Berlin / Heidelberg},
  isbn = {978-3-642-14454-7},
  pages = {352--363},
  volume = {6224},
  url = {http://dx.doi.org/10.1007/978-3-642-14455-4_32},
  note = {10.1007/978-3-642-14455-4_32},
  year = {2010},
  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
counter-part 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.}
}