Henning Fernau, Rudolf Freund, Markus Holzer  Home/Search
Context
Related
| fs.informatik.uni...rayfiniteII.ps.gz ti.informatik.uni...rayfiniteII.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fs.informatik.unitueb...pubnear (more) From: ti.informatik.unitueb...pubnear (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We introduce special k-head finite array automata, which characterize the array languages generated by specific variants of regulated n-dimensional context-free array grammars of finite index we introduced in the first part of this paper. As a practical application we show how these analyzing devices in the two-dimensional case can be used in the field of syntactic character recognition. 1 Bridging the gap between theory and practice The first part of this paper laid some theoretical... (Update)
Similar documents (at the sentence level):
6.9%: Character Recognition with k-Head Finite Array Automata - Fernau, Freund, Holzer (Correct)
Active bibliography (related documents): More All
4.8: Regulated Array Grammars of Finite Index - Part I.. - Fernau, Freund, Holzer (Correct)
0.5: Bounded Parallelism in Array Grammars Used for Character.. - Fernau, Freund (1996) (Correct)
0.5: Regulated Grammars under Leftmost Derivation - Fernau (1999) (Correct)
Similar documents based on text: More All
0.3: Bidirectional Cooperating Distributed Grammar Systems - Fernau, Holzer (1996) (Correct)
0.3: Regulated Finite Index Language Families Collapse - Fernau, Holzer (1996) (Correct)
0.3: Representations Of Recursively Enumerable Array Languages .. - Freund, Fernau, Holzer (Correct)
BibTeX entry: (Update)
@misc{ fernau-regulated,
author = "Henning Fernau and Rudolf Freund and Markus Holzer",
title = "Regulated Array Grammars of Finite Index - Part II: Syntactic pattern recognition",
url = "citeseer.ist.psu.edu/79245.html" }
Citations (may not include all citations):28 the recognition of printed characters of any font and size (context) - Kahan, Pavlidis et al. - 1987
14 the capability of finite automata in 2 and 3 dimensional spa.. (context) - Blum, Sakoda - 1977
7 On multihead finite automata (context) - Rosenberg - 1966
6 Accepting cooperating distributed grammar systems with termi.. (context) - Mihalache - 1997
5 Automata on a two-dimensional tape (context) - Blum, Hewitt - 1967
4 Syntactic recognition of handwritten characters by programme.. (context) - Freund - 1993
4 A characterization of recognizable picture languages (context) - Inoue, Takanami - 1992
4 An improved parallel algorithm for thinning digital patterns (context) - Sossa - 1989
4 An application of array grammars to clustering analysis for .. (context) - Wang - 1984
4 On parallel Turing machines with multi-head control units - Worsch - 1996
3 Computer Graphics and Image Processing (context) - Nakamura, Sigma et al. - 1980
3 Some notes on finite-state picture languages (context) - Rosenfeld - 1976
3 Some results concerning automata on two-dimensional tapes (context) - Ibarra, Melson - 1974
2 Acta Informatica (context) - RuBetamann, LL et al. - 1997
2 Systeme von Turing-Automaten auf rahmbaren Pseudomustermenge.. (context) - Hemmerling - 1979
2 Pushdown automata on arrays (context) - Shah - 1981
2 Three-dimensional array grammars and object recognition (context) - Wang - 1991
2 Technische Universitat Wien (context) - Dittmann, thesis - 1997
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC