5499 search results - page 269 / 1100 » Generalized Rewrite Theories |
173
click to vote
AUTOMATICA
2007
15 years 7 months ago
2007
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
190
click to vote
EJC
2010
15 years 7 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
125
click to vote
EJC
2006
15 years 7 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...
209
click to vote
JCT
2008
15 years 7 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
169
click to vote
JSC
2008
15 years 7 months ago
2008
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...