1650 search results - page 14 / 330 » The HOM problem is decidable |
STACS
2010
Springer
14 years 22 days ago
2010
Springer
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...
HYBRID
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
JALC
2006
13 years 7 months ago
2006
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
ENTCS
2008
13 years 7 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...