1. RESULTS: PERFORMANCE ANALYSIS
PART 1- TEXTUAL INDICATORS
PART 2- PRESENTATION OF RESULTS
PART 3- COMMENTS

2. RESULTS: PERFORMANCE ANALYSIS
PART 1-TEXTUAL INDICATORS
 Pointers
The measured mean errors are given in Figs. 3-5
 Structure of section indicators
In this section, we formally define b-suffix trees and introduce several parameters of these tress that are widely used in the complexity analysis of algorithms on words and data compression schemes. Next, we present all of our main results. We delay most of the proof to the next section. Finally, we discuss some consequences of our findings.

3. RESULTS: PERFORMANCE ANALYSIS
PART 2- PRESENTATION OF RESULTS
 Procedural sub-sections
Some tradeoff studies were performed using the examples in Section 4.1. We studied the role of intersubtask communication in synthesis of the systems. The study was performed by varying the ration between communication times and execution times.
 Hypotheses restated
The major hypothesis advanced in this paper is that in a significant number of inductive proofs the ripple tactic alone will successfully guide the step case between the application of the inductive rule to the use of the induction hypothesis. We predict that we can use…
 Statement of data
In 72 percent (18 times out 25) of the cases, the learned operator has an equivalent or more general LHS and RHS that the corresponding handcoded operator.

4. RESULTS: PERFORMANCE ANALYSIS
PART 3- COMMENTS
 Comparison of findings with the literature
The pignistic probability distribution was first presented by Williams (7) and Dubois and Prade (2). Because of the results of Smets, I shall use a measure of distance between the pignistic distribution of…
 Evaluation
These preliminary results seem to support the initial claim that optical techniques may contribute significantly to the cause of database management.
 Further research suggested
Of course, further research is needed to overcome the technology problems and make the first optoelectronic database machine a reality.

5. RESULTS: PERFORMANCE ANALYSIS
PART 3- PRESENTATION OF RESULTS
 Implications
Theorems 1 and 2 find several applications in combinatorial problems on words, data compression, and molecular biology. In general, our findings can be used widely in problems dealing with repeated patterns and other regularities on strings.
 Summarising
In summary, the simulation results demonstrate the following…