1650 search results - page 93 / 330 » The HOM problem is decidable |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
LOGCOM
2006
13 years 10 months ago
2006
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
DAM
2011
13 years 4 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
FORMATS
2009
Springer
14 years 4 months ago
2009
Springer
Embedded real-time systems are typically programmed in low-level languages which provide support for event-driven task processing and real-time interrupts. We show that the model c...
FOSSACS
2007
Springer
14 years 4 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...