1716 search results - page 123 / 344 » Proving Conditional Termination |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
DM
2006
13 years 9 months ago
2006
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
EJC
2006
13 years 9 months ago
2006
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
JSCIC
2008
13 years 8 months ago
2008
In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system o...
ENTCS
2007
13 years 8 months ago
2007
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...