Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,251
Table 1: Complexity results for regular and strongly regular evolution frames.
"... In PAGE 39: ...f the belief set. Moreover, C5 accepts C1 iff BXBYBN C3BU CYBP BXBYC9CPCRCRCTD4D8. Since BXBY is contracting and BC-bounded, and since the membership tests BX BE BXBV and D6 BE BUCTD0B4A1B5, as well as the functions A5 and AQ are computable in time polynomial in the size of BXBY, deciding TEMPEVO in BXBY is EXPSPACE-hard. BE The complexity results obtained so far are summarized in Table1 . Further results can be derived by imposing additional meaningful constraints on the problem instances.... ..."
Table 2. Estimated distance between regularity and strong regularity for relative perturbations
in The
Table 2 contains an axiom system for T(BPA (A)). It consists of the standard axioms A1-5 together with three axioms BKS1-3 for the binary Kleene star. The most advanced axiom BKS3 originates from Troeger [23]. In the sequel, P = Q will mean that this equality can be derived from the axioms. This axiomatization is sound for T(BPA (A)) with respect to bisimulation equivalence, i.e., if P = Q then P $ Q. Since bisimulation equivalence is a con- gruence, this can be veri ed by checking soundness for each axiom separately, which is left to the reader. The purpose of this paper is to prove that the axio- matization is complete with respect to bisimulation, i.e., if P $ Q then P = Q.
1996
"... In PAGE 4: ... Table2 . Axioms for T(BPA (A)) In the sequel, terms are considered modulo associativity and commutativity of the +, and we write P =AC Q if P and Q can be equated by axioms A1,2.... ..."
Cited by 5
Table 2 contains an axiom system for T(BPA (A)). It consists of the standard axioms A1-5 together with three axioms BKS1-3 for the binary Kleene star. The most advanced axiom BKS3 originates from Troeger [23]. In the sequel, P = Q will mean that this equality can be derived from the axioms. This axiomatization is sound for T(BPA (A)) with respect to bisimulation equivalence, i.e., if P = Q then P $ Q. Since bisimulation equivalence is a con- gruence, this can be veri ed by checking soundness for each axiom separately, which is left to the reader. The purpose of this paper is to prove that the axiom- atization is complete with respect to bisimulation, i.e., if P $ Q then P = Q.
1996
"... In PAGE 4: ... Table2 . Axioms for T(BPA (A)) In the sequel, terms are considered modulo associativity and commutativity of the +, and we write P =AC Q if P and Q can be equated by axioms A1,2.... ..."
Cited by 5
Table 5: Test powers: regular cointegration, strong null
Table 6. Triple Coded Folder Names
2005
"... In PAGE 6: ... It would be interesting to see whether the same findings occur in a situation where there was not such strong time based replication as in the university. In addition to these folders that are dual coded, Table6 shows the combinations of triple coding that were found. Table 6.... ..."
Cited by 4
Table 22: Rules for integration (a 2 A, r gt; 0, p; q 0)
"... In PAGE 7: ... They re ect the informal explanation given above. Semantics The structural operational semantics of ACPsatI is described by the rules for ACPsat and the rules given in Table22 . Bisimulation equivalence is also a con- gruence for the integration operator.... ..."
Table 1 Stations N, Hyperbolae H, and Triple Junctions T by Jackknife Analysis
"... In PAGE 5: ... Likewise, the upper limit for the number of triple junctions T is given by Eq. (2) These formula govern a strong increase of permutations, as displayed in Table1 for N =... ..."
Table 4.3: Local graphs of strongly regular graphs with covers of diameter five.
Results 1 - 10
of
11,251
