Sciweavers

759 search results - page 80 / 152
» Overlap-Free Regular Languages
Sort
View
CICLING
2003
Springer
15 years 3 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
14 years 8 months ago
Understanding and executing instructions for everyday manipulation tasks from the World Wide Web
Service robots will have to accomplish more and more complex, open-ended tasks and regularly acquire new skills. In this work, we propose a new approach to generating plans for su...
Moritz Tenorth, Daniel Nyga, Michael Beetz
FSTTCS
2010
Springer
14 years 7 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz
NAACL
2010
14 years 7 months ago
Subword Variation in Text Message Classification
For millions of people in less resourced regions of the world, text messages (SMS) provide the only regular contact with their doctor. Classifying messages by medical labels suppo...
Robert Munro, Christopher D. Manning
JAC
2008
14 years 11 months ago
Two-dimensional cellular automata recognizer equipped with a path
In this paper, two-dimensional cellular automata as one-dimensional language recognizers are considered. Following the approach of M. Delorme and J. Mazoyer to embed one-dimensiona...
Véronique Terrier