Page 297 -

Bibliography 285

Stenstrom JR (1988) Training and Model Generation for a Syntactic Curve Network Parser.
In: Ferratt G, Pavlidis T, Sanfeliu A, Bunke H (eds) Syntactic and Structural Pattern
Recognition. Springer-Verlag, pp. 249-267.
Tai JW, Liu YJ (1990) Chinese Character Recognition. In: Bunke H, Sanfeliu A (eds)
Syntactic and Structural Pattern Recognition. Theory and Applications. World Scientific
Pub. Co., Singapore.
Thomason GT (1990) Introduction and Overview. In: Bunke H, Sanfeliu A (eds) Syntactic
and Structural Pattern Recognition. Theory and Applications. World Scientific Pub. Co.,
Singapore.
Ton J, Jain AK (1989) Registering Landsat Images by Point Matching. IEEE Tr Geosci and
Rem Sensing, 27:642-65 1.
Tsai WH (1990) Combining Statistical and Structural Methods. In: Bunke H, Sanfeliu A
(4s) Syntactic and Structural Paltern Recognition. Theory and Applications. World
Scientific Pub. Co., Singapore.
VBmos T (1977) Industrial Objects and Machine Parts Recognition. In: Fu KS (ed) Syntactic
Pattern Recognition Applications. Springer-Verlag.
Wong AKC. Constant J, You ML (1990) Random Graphs. In: Bunke H and Sanfeliu A (eds)
Syntactic and Structural Pattern Recognition. Theory and Applications. World Scientific
Pub. Co., Singapore.
You KC, Fu KS (1979) A Syntactic Approach to Shape Recognition Using Attributed
Grammars. IEEE Tr Systems, Man and Cybernetics, 9:334-345.

Exercises

6.1 Consider the grammar presented in (6-7d).
a) What type of grammar is it?
b) Two grammars GI. G2 are considered equivalent if L(Gl)= L(G2). Is there a regular
grammar equivalent to (6-7d)? Why?
6.2 A grammar for waveform description has the following production rules:

a) Interpret the production rules. What type of grammar is it?
b) Which of the following sequences is parsed by the grammar: hhud; huuhdd ?

6.3 Modify the production rules (6-12a) so that the corresponding grammar will recognize
positive and negative spikes formed by an arbitrary number of D and Wprimitives, with
at most an h primitive between.

6.4 Consider the symbol set T = (h, p) used to describe signals, where h represents a
horizontal segment and p is a positive peak. Build a regular grammar capable of
recognizing sequences terminated by hph, i.e., by isolated peaks. Draw the state
diagram of the finite-state automaton that recognizes such sequences.