Abstract
We introduce the, concept of k-head finite two-dimensional array automata and show how this model of two-dimensional array automata can be applied in the field of syntactic: character recognition. Moreover, we discuss some of the problems arising; with implementing the theoretical concept to obtain an efficient tool for the syntactic analysis of handwritten (uppercase characters.
Supported by Deutsche Forschungsgemeinschaft grant DFG La 618/3-2.
Chapter PDF
References
M. Blum and C. Hewitt, Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory (1967), pp. 155–160.
C. R. Cook and P. S.-P. Wang, A Chomsky hierarchy of isotonic: array grammars and languages, Computer Graphics and Image Processing 8 (1978), pp. 144–152.
J. Dassow and Ch. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989).
W. Dittmann, Character recognition by array systems of bounded index, Diploma thesis, Techn. Univ. Wien, Austria, 1997.
H. Fernau and P. Freund, Bounded parallelism in array grammars used for character recognition. In: P. Perner, P. S.-P. Wang, and A. Rosenfeld (eds.), Proceedings SSPR'96, LNCS 1121 (Springer, Berlin, 1996), pp. 40–49.
H. Fernau, R. Freund, and M. Holzer, Regulated array grammars of finite index, Part I. Theoretical investigations, to appear in: [13].
H. Fernau, R. Freund, and M. Holzer, Regulated array grammars of finite index, Part II: Syntactic pattern recognition, to appear in: [13].
R. Freund, Array grammar systems with prescribed teams of array productions. In: J. Dassow, Ch. Păun and A. Salomaa (eds.), Developments in Language Theory II (Gordon and Breach, London, 1996), pp. 220–229.
R. Freund, Syntactic recognition of handwritten characters by programmed array grammars with attribute vectors, Seventh International Conference on Image Analysis and Processing, Bari, Italy, in: Progress in Image Analysis and Processing III (ed. S. Impedovo, World Scientific Publ., Singapore, 1993), pp. 357–364.
O. Ibarra and R. T. Melson, Some results concerning automata on two-dimensional tapes, International Journal of Computer Mathematics, Series A 4 (1974), pp. 269–279.
K. Inoue and I. Takanami, A survey of two-dimensional automata theory. In: J. Dassow and J. Kelemen (eds.), Machines, Languages, and Complexity, IMYCS'88, LNCS 381 (Springer, Berlin, 1988), pp. 72–91.
A. Nakamura, Parallel Σ-erasing array acceptors, Computer Graphics and Image Processing 14 (1980), pp. 80–86.
Ch. Păun and A. Salomaa (eds.), Grammatical Models of Multi-Agent Systems (Gordon and Breach, Reading, UK, 1998).
A. L. Rosenberg, On multihead finite automata, IBM J. Res. Develop. 10 (1966), pp. 388–394.
A. Rosenfeld, Some notes on finite-state picture languages, Information and Control 31 (1976), pp. 177–184.
A. Rosenfeld, Picture Languages (Academic Press, Reading, MA, 1979).
J. H. Sossa, An improved parallel algorithm for thinning digital patterns, Pattern Recognition Letters 10 (1989), pp. 77–80.
P. S.-P. Wang, Some new results on isotonic array grammars, Information Processing Letters 10 (1980), pp. 129–131.
P. S.-P. Wang, An application of array grammars to clustering analysis for syntactic patterns, Pattern Recognition 17, 4 (1984), pp. 441–451.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H., Freund, R., Holzer, M. (1998). Character recognition with k-head finite array automata. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033246
Download citation
DOI: https://doi.org/10.1007/BFb0033246
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive