1650 search results - page 116 / 330 » The HOM problem is decidable |
167
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
161
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
179
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
148
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
160
click to vote
ACSD
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...