762 search results - page 104 / 153 » Intercode Regular Languages |
126
click to vote
JALC
2007
15 years 2 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
132
click to vote
ICRA
2010
IEEE
15 years 26 days ago
2010
IEEE
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...
103
click to vote
FSTTCS
2010
Springer
15 years 10 days ago
2010
Springer
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 ...
94
Voted
NAACL
2010
15 years 7 days ago
2010
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...
WWW
2003
ACM
16 years 3 months ago
2003
ACM
This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. Under this framework, peers (individual e-services) communicate throug...