1537 search results - page 37 / 308 » On sets not belonging to algebras |
CONCUR
2001
Springer
14 years 4 days ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
COMBINATORICS
2004
13 years 7 months ago
2004
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
ARSCOM
2007
13 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
FSS
2010
13 years 6 months ago
2010
H¨ohle has identified fuzzy sets, valued in a frame (complete Heyting algebra) Ω, with certain sheaves over Ω: the subsheaves of constant sheaves More general sheaves can be...