Results 11  20
of
1,260,910
The Hereditarily Finite Sets
, 2014
"... The theory of hereditarily finite sets is formalised, following the development of Świerczkowski [2]. An HF set is a finite collection of other HF sets; they enjoy an induction principle and satisfy all the axioms of ZF set theory apart from the axiom of infinity, which is negated. All constructio ..."
Abstract
 Add to MetaCart
The theory of hereditarily finite sets is formalised, following the development of Świerczkowski [2]. An HF set is a finite collection of other HF sets; they enjoy an induction principle and satisfy all the axioms of ZF set theory apart from the axiom of infinity, which is negated. All
Families of finite sets in . . .
, 2002
"... ... introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (J. Combin. Theory Ser. A 33 (1982), 158–166 and Israel J. Math. 51 (1985), 75–89). In the prese ..."
Abstract
 Add to MetaCart
... introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (J. Combin. Theory Ser. A 33 (1982), 158–166 and Israel J. Math. 51 (1985), 75
FINITE SETS WITH AN APPLICATION TO DISCRETE
, 2007
"... Link to publication Citation for published version (APA): van der Laan, G., Talman, A. J. J., & Yang, Z. F. (2007). Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations. (CentER Discussion Paper; Vol. 200788). Tilburg: Operations ..."
Abstract
 Add to MetaCart
Link to publication Citation for published version (APA): van der Laan, G., Talman, A. J. J., & Yang, Z. F. (2007). Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations. (CentER Discussion Paper; Vol. 200788). Tilburg: Operations
Finitely based, finite sets of words
 Internat. J. Algebra Comput
"... For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by S(W). It is shown that for every finite set of words W, there are sets of words U ⊃ W and V ⊃ W such that the identities ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by S(W). It is shown that for every finite set of words W, there are sets of words U ⊃ W and V ⊃ W
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (35 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Finite Sets And Symmetric Simplicial Sets
 Theory Appl. Categ
, 2001
"... The category of finite cardinals (or, equivalently, of finite sets) is the symmetric analogue of the category of finite ordinals, and the ground category of a relevant category of presheaves, the augmented symmetric simplicial sets. We prove here that this ground category has characterisations simil ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The category of finite cardinals (or, equivalently, of finite sets) is the symmetric analogue of the category of finite ordinals, and the ground category of a relevant category of presheaves, the augmented symmetric simplicial sets. We prove here that this ground category has characterisations
The ordinal numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and oth ..."
Abstract

Cited by 722 (70 self)
 Add to MetaCart
and other properties of order relation of cardinals. In the second section we show that every set has cardinal number equipotence to it. We introduce notion of alephs and we deal with the concept of finite set. At the end of the article we show two schemes of cardinal induction. Some definitions are based
Posterior Probability on Finite Set
, 2012
"... In [14] we formalized probability and probability distribution on a finite sample space. In this article first we propose a formalization of the class of finite sample spaces whose element’s probability distributions are equivalent with each other. Next, we formalize the probability measure of the ..."
Abstract
 Add to MetaCart
In [14] we formalized probability and probability distribution on a finite sample space. In this article first we propose a formalization of the class of finite sample spaces whose element’s probability distributions are equivalent with each other. Next, we formalize the probability measure
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
secting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “HamiltonJacob? ’ type equation written for a function in which the interface is a particular level set. A speed term synthesizpd from the image is used to stop the interface
Results 11  20
of
1,260,910