1650 search results - page 26 / 330 » The HOM problem is decidable |
118
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
123
click to vote
COLING
1996
15 years 5 months ago
1996
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
134
click to vote
HYBRID
2009
Springer
15 years 1 months ago
2009
Springer
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
140
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
142
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...