### Table2. SP Denotation. Above CB AI BV and ACBMABBC is the concatenation of the finite sequence AC followed by ABBC. The sequence BLDCAB results from applying BLDC to each constraint in AB. In DSUM if C1 BP BN, the indexed union and intersection are taken to be BN and CBAX, respectively.

2003

"... In PAGE 8: ... Valencia around the algorithmic problems illustrated above, the characterizations will be guided by the sp denotational semantics of ntcc [14] rather than its operational semantics. The ntcc denotational semantics CJCJA1CLCL BM C8D6D3CR AX C8B4BVAXB5BN given in Table2 by taking CJCJA1CLCL BP CJCJA1CLCLBVBN is meant to capture the sp. From [5], however, we know that there cannot be a CU BM C8D6D3CR AX BVAXBN compositionally defined, such that CUB4C8B5 BP D7D4B4C8B5 for all C8.... ..."

Cited by 2

### Table 2: Unique input/output circuit sequences for each state of the finite state machine shown in Table 1.

in finite

2006

"... In PAGE 10: ... The input set is I = {a, b, c, d} and output set O = {x, y}. In order to simplify the analysis, a set of UIOCs (shown in Table2 ) is used for state verification. For each state, the first UIOC sequence is used for the generation of the test sequence.... ..."

### Table 6. Sturm Sequences (NAG F02BFF) applied to Finite Di erence Eigenproblem

"... In PAGE 17: ... The fact that such a transformation exists justi es the use of the Sturm Sequence Algorithm (see Wilkinson [14]) to nd the nite di erence eigenvalues. Table6 shows the results of attempts to nd the zeroth eigenvalue (which is zero) using the NAG routine F02BFF. The value of was 0.... ..."

### Table2. CJCJA1CLCLCB BM C8D6D3CR AX C8B4CBAXB5 SP Denotation. Above CB AI BV and ACBMABBC is the concatenation of the finite sequence AC followed by ABBC. The sequence BLDCAB results from applying BLDC to each constraint in AB. In DSUM if C1 BP BN, the indexed union and intersection are taken to be BN and CBAX, respectively.

"... In PAGE 15: ... SP Denotational Representation. The sp denotational semantics CJCJA1CLCL BM C8D6D3CR AX C8B4BVAXB5 of ntcc given in [29] is obtained from Table2 by taking CJCJA1CLCL BP CJCJA1CLCLBV. Hence, in what follows we shall simply write CJCJA1CLCL rather than CJCJA1CLCLBV.... ..."

### Table 1 summarizes the types of basic gaits of the Planar Walker. Because the gaits are initial-state dependent, they are categorized into two major groups according to the states of the cylinders: fully retracted or fully extended. Gaits with identical initial states can be used alternatively right away because the final state of the prior gait is identical to the initial state of the subsequent gait. A transition sequence is needed between gaits with different initial states. This transition sequence can be obtained using a finite automaton called a gait generator [12].

"... In PAGE 2: ... Table1 : Notations and pose changes of gaits x y N E S W N E S W {A} {B} p1 p2 p3 p4 pab pG pS Figure 5: Pose change of the robot 3. KINEMATICS OF BASIC GAITS In this section, we study the kinematics of the robot based on the execution of a series of gaits.... ..."

### Table 9. Discordant Calls in SNP Genotyping Validation Using Affymetrix 500K, Illumina HumanHap650Y in Comparison with Sequence from the HuRef Assembly

"... In PAGE 12: ... Of the 86,157 discordant genotype calls, the vast majority (83.9%) were identified as heterozygous in the merged genotyping platform data, but called as homozygous in the HuRef assembly ( Table9 ). This is consistent with a predict- able effect of finite sequence coverage in the HuRef dataset: assuming uniform random sampling of both haplotypes, 21.... In PAGE 12: ... This is close to the observed false-negative error of 24.6% ( Table9 and Figure 8). Consistent with this explanation, the level of coverage is significantly lower for the missed heterozygous SNPs than for the heterozygous SNPs detected in the HuRef assembly (average read depth 5.... ..."

Cited by 1

### Table 3 Summary of Cases Analyzed using NIKE 2D Finite Element Program

1999

"... In PAGE 15: ... Results of all of the analyses are presented in the sequence in which they were accomplished to illustrate the process used to arrive at the recommended thickness for the overlay pavement structure. Table3 summarizes the simulations performed and Figure 6 shows the locations at which critical strains, principal tensile and maximum shear, were determined. 2.... In PAGE 25: ...ikely be placed and that the binder would be an asphalt rubber. Earlier studies, e.g., Reference (4) have shown that the stiffness of this type of mix is similar to that of the PBA-6A mix. Thus, as seen in Table3 , the section used for analysis consisted of 5 in. of material with a stiffness of 900,000 psi and 4 in.... ..."

### Table No No FSA Yes Finite

in Genetic Programming Using a Turing-Complete Representation: Recurrent Network Consisting of Trees

2003

### Table 3: The DTD Graph Operations.

"... In PAGE 22: ... The DTD graph BZBC can then be converted to BZBCBC using Lemma 2. Theorem 2 Given two arbitrary DTD graphs BZ and BZBCBC, there is a finite sequence of DTD change operations shown in Table3 that can transform BZ to BZBCBC. Proof: The set of operations CUcreate-ver, add-edge, delete-verCV all have equivalent operations in the DTD change taxonomy.... ..."