2944 search results - page 174 / 589 » On Well Quasi-orders on Languages |
153
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
195
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Grids are very complex and volatile infrastructures that exhibit parallel and distributed characteristics. To harness their complexity as well as the increasing intricacy...
199
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
121
click to vote
ACL
2007
15 years 8 months ago
2007
A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as “if objects come af...
146
click to vote
COLING
2008
15 years 8 months ago
2008
This demonstration introduces two new multilingual translation services for mobile phones. The first translation service provides state-of-the-art text-to-text translations of Jap...