A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e., a set of symbol arrays). A "reversible " PCAAG (RPCAAG) is a backward deterministic PCAAG, and t
Proc. of The Fifth International Workshop on Parallel Image Analysis (IWPIA'97) Sept. 29{30, 1997, Hiroshima, Japan
Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata Faculty of Engineering, Hiroshima University, Higashi-Hiroshima 739, Japan morita@ke.sys.hiroshima-u.ac.jp Satoshi Ueno Tohoku Seiki Industries, Yamagata 990-22, Japan Katsunobu Imai Faculty of Engineering, Hiroshima University, Higashi-Hiroshima 739, Japan imai@ke.sys.hiroshima-u.ac.jp A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e., a set of symbol arrays). A\reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an\inverse" system of the RPCAAG. Hence, a parallel pattern recognition mechanism on a deterministic cellular automaton can be directly obtained from a RPCAAG that generates the pattern set. In this paper, we investigate the generating ability of RPCAAGs and their subclass. It is shown that the ability of RPCAAGs is characterized by two-dimensional deterministic Turing machines, i.e., they are universal in their generating ability. We then investigate a monotonic RPCAAG (MRPCAAG), which is a special type of an RPCAAG that satis es monotonic constraint. We show that the generating ability of MRPCAAGs is exactly characterized by two-dimensional deterministic linear-bounded automata.
Kenichi Morita
Abstract
1 Introduction A PCA array generator (called PCAAG) introduced by Morita and Ueno 3] is a parallel generating system of symbol arrays using a nondeterministic partitioned cellular automata (PCA), a kind of CA. It has some similarity with a system of array grammars 1, 5, 6, 7], because, in both systems, symbol arrays are generated from a start symbol by applying rewriting (or transition) rules repeatedly. It is a little di cult to introduce parallelism for a grammar formalism. But, a PCAAG is by nature a parallel system, and thus suited for formulating and studying parallel array generation. Another advantage of a PCAAG is that we can de ne a\reversible" version RPCAAG. Roughly speaking, it is a backward deterministic system. Hence, parsing of an array language (i.e., a set of symbol arrays) can be performed without backtracking using an inverse system of the RPCAAG 3]. Therefore, parallel pattern recognition system on a deterministic CA can be immediately obtained, if the pattern set is described by an RPCAAG. In 3] several examples of RPCAAGs that generate sets of geometrical patterns in parallel were given. In this paper, we characterize the abilities of RPCAAGs in terms of two-dimensional deterministic automata. First, it is shown that RPCAAGs are characterized by two-dimensional deterministic Turing machines. Hence, even if the reversibility constraint is added, they are still universal in their generating ability. We then
investigate a monotonic RPCAAG (MRPCAAG) 3], which is an RPCAAG satisfying monotonic constraint. We prove that MRPCAAGs are exactly characterized by deterministic two-dimensional linear-bounded automata. 144
14(1): 1-19 Characterizing Indirect Speech Acts Brown, Gretchen P. 6(3-4): 150-166 Comments on Pullum's Criticisms Langendoen, D. Terence and ...
Characterizing the SPHINX Speech Recognition System This paper examines SPHINX, a system for speaker independent, large vocabulary, continuous speech recognition...
Characterizing Accounting Research_经管营销_专业资料。论文Characterizing Accounting Research Derek K. Oler? Area of Accounting, Rawls College of Business Texas...
Characterizing Network Traffic_英语学习_外语学习_教育专区。Characterizing Network TrafficLecture 4 Characterizing the Existing Internetwork and Characterizing ...
Constructively characterizing fold and unfold_专业资料。Abstract. In this paper we formally state and prove theorems characterizing when a function can be ...
www.elsevier.com/locate/landurbplan Characterizing growth types and analyzing growth density distribution in response to urban growth patterns in peri-urban ...
Logically characterizing adaptive educational hypermedia systems Abstract. Currently, adaptive educational hypermedia systems (AEHS) are described with nonuniform ...
Logically characterizing adaptive educational hypermedia systems Abstract. Currently, adaptive educational hypermedia systems (AEHS) are described with nonuniform ...
2007, 19, 6555–6560 6555 Characterizing Polymer Brushes via Surface Wrinkling Heqing Huang, Jun Young Chung, Adam J. Nolte, and Christopher M. Stafford...
Characterizing the walnut genome through analyses of BAC end_农学_农林牧渔_专业资料。Plant Mol Biol (2012) 78:95–107 DOI 10.1007/s11103-011-9849-...
热门文档