K. Inoue and I. Takanami. A characterization of recognizable picture languages. In Proc. 2nd International Colloquium on Parallel Image Processing, volume 654 of Lecture Notes in Computer Science, pages 133--143. Springer-Verlag, Berlin, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....picture languages by projection of local picture languages that is a well known property in string languages. This class is very interesting since it corresponds to the class of picture languages recognizable by a particular class of cellular automata called on line tessellation automata [13], and to the class of picture languages definable by existential expressions in monadic second order logic [9] A survey of the topic is given in the Handbook of Formal Languages [8] In the string language theory, it is well known [4, 14, 15, 19] that any recognizable string language can be ....

K. Inoue and I. Takanami. A characterization of recognizable picture languages. In Proc. 2nd International Colloquium on Parallel Image Processing, volume 654 of Lecture Notes in Computer Science, pages 133--143. Springer-Verlag, Berlin, 1991.

....: Gamma Sigma is well defined as ( a 1 ; a 2 ) 1 (a 1 ) 2 (a 2 ) 8(a 1 ; a 2 ) 2 Gamma 1 Theta Gamma 2 : 2 20 Remark that the closure under union together with Example 7.3 imply that all finite languages belong to L(TS) In a different set up, K. Inoue and I. Takanami (cf. [22], 18] 19] proved that L(TS) is not closed under Boolean complementation. We give here a shorter proof of this fact, that refers directly to family L(TS) and uses a combinatorial argument Theorem 7.5 The family L(TS) is not closed under complement. Proof: Let Sigma = fa; bg an alphabet and ....

....theorems among the families of recognizable string languages. 8.1 Tiling systems and automata Tiling systems for picture languages were defined generalizing to the two dimensional case a characterization of finite automata for strings in terms of local sets and projections (see Section 7. 2) In [22] K. Inoue and I. Takanami proved that tiling systems can be viewed as machine devices. More specifically, a tiling system can simulate an on line tesselation automaton and vice versa. This is the contents of the following theorem. Theorem 8.1 L(2OTA) L(TS) To make to proof of the theorem ....

K. Inoue and I. Takanami. A Characterization of recognizable picture languages. In Proc. Second International Colloquium on Parallel Image Processing, A. Nakamura et al. (Eds.), Lecture Notes in Computer Science 654, Springer-Verlag, Berlin 1993.

....form and might be processed in parallel when simulating an array grammar) is quite limited when generating a certain character by means of an array grammar. This naturally leads to the consideration of bounded parallelism within array grammars. Such studies have been initiated by the authors in [6, 7]. The feature of bounded parallelism can nicely be formulated in terms of cooperating distributed array grammar systems [1, 4] with prescribed teams [13, 20, 24] On the other hand, a limitation on the number of active working areas resembles very much the finite index feature well known from ....

K. Inoue and I. Takanami, A characterization of recognizable picture languages. In: A. Nakamura, M. Nivat, A. Saoudi, P. S.-P. Wang, and K. Inoue (eds.), Parallel Image Analysis ICPIA'92, LNCS 654 (Springer, Berlin, 1992), pp. 133--143.

No context found.

K. Inoue and I. Takanami, A characterization of recognizable picture languages. In: A. Nakamura, M. Nivat, A. Saoudi, P. S.-P. Wang, and K. Inoue (eds.), Parallel Image Analysis ICPIA'92, LNCS 654 (Springer, Berlin, 1992), pp. 133--143.

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