1650 search results - page 26 / 330 » The HOM problem is decidable |
ICALP
2004
Springer
14 years 1 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 ...
COLING
1996
13 years 9 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...
HYBRID
2009
Springer
13 years 5 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...
BMCBI
2005
13 years 7 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...
LICS
2009
IEEE
14 years 2 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...