### Table 1. Mapping of Entities between Timing Diagrams and Algebraic Specifications.

2007

"... In PAGE 2: ... Since our testing methodology is built on algebraic specifications [7], the editor further translates the CFSM model into an algebraic representation. Table1 shows a mapping of the entities between timing diagrams and algebraic specifications. For example, stations and actions in timing diagrams bear the same meaning as classes and methods in algebraic specifications.... ..."

Cited by 2

### Table 6: Complexity of operations on decision diagrams.

2002

"... In PAGE 37: ... It is well known that using a different branching factor, or representing a function by a vector of diagrams, has no effect on the complexity of the operations used during model-checking [41]. The middle column of Table6 summarizes these complexities of the operations from the left column with respect to the size of the graph representing the diagram. Note that even though we can think of representing an mv-set using a vector of diagrams, the underlying implementation constructs a single directed acyclic graph.... In PAGE 37: ... Moreover, since the underlying graph is connected, we can express the complexity of operations relative to the number of nodes in this graph. These complexities are given in the right column of Table6 , where a9 is the number of nodes and a33 is the branching factor of the decision diagram. Using this representation of complexity, we infer the expected running time based on the empirical evidence on the sizes of different decision diagrams.... ..."

### Table 1 Correspondences between the algebra of Flownomials and the block diagram algebra. Note : ( , . . .)n means the composition of n identity in parallel.

### Table 1. Dynkin diagrams corresponding to nite dimensional complex simple Lie algebras

"... In PAGE 27: ... Finite dimensional complex simple Lie algebras (2.1) Dynkin diagrams and Cartan matrices A Dynkin diagram is one of the graphs in Table1 . A Cartan matrix is one of the matrices in Table 2.... ..."

### TABLE II AVERAGE NUMBER OF NODES AND EVALUATION TIME OF DECISION DIAGRAMS.

2003

Cited by 4

### Table 4.1 Walsh Spectral Decision Diagrams

2002

### Table 4.3 Arithmetic Spectral Decision Diagrams

2002

### Table 1: Six types of problems in Elementary Algebra

2006

"... In PAGE 4: ... A simple example of a precedence relation between problems is illustrated by Fig. 1, which displays a plausible precedence diagram pertaining to the six types of algebra prob- lems illustrated in Table1 . Note in passing that we distinguish between a type of problem and an instance of that type.... In PAGE 5: ...recedence relation proposed by the diagram of Fig. 1 is a credible one. For example, if a student responds correctly to an instance of Problem (f), it is highly plausible that the same student has also mastered the other five problems. Note that this particular precedence relation is part of a much bigger one, representing a comprehensive coverage of all of Beginning Algebra, starting with the solution of simple linear equations and ending with problem types such as (f) in Table1 . An example of such a larger precedence relation is represented by the diagram of Fig.... In PAGE 8: ... 2 or 3 obtained?) This question and other critical ones are considered later on in this article. For the time being, we focus on the miniature example of Table1 which we use to introduce and illustrate the basic ideas. The knowledge states.... ..."

Cited by 1

### Table 1: Relations of Canonical AND/EXOR Trees, Expressions and Decision Diagrams

1997

"... In PAGE 5: ... III. ENHANCING THE GREEN/SASAO HIERARCHY WITH NEW REPRESENTATIONS Table1 shows relationships of the canonical trees, the canonical expressions, and the decision diagrams created from these trees by applying the reduction rules. This table adds new AND/EXOR representations, Zhegalkin Forms 1, to the table from [33].... In PAGE 8: ...iew.Similarly as in examples 2.2 and 2.3 one can create functions that prove that the proper inclusion relations illustrated in Table1 and Figure 4 are true; for instance, that the MPGKTs are better than PGKTs, the MPGKE are better than PGKEs, and so on. An interesting open question is the following: quot;Is the FGKE family of expansions equal to the well-known class of ESOP circuits or is it properly included in ESOP, as the Figure 4 would suggest? quot; The guess of the authors is that it is very close to ESOP but not the same and perhaps only experimentation will answer this question.... ..."

Cited by 4