Iso-array rewriting P systems with context-free iso-array rules

A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al. initially proposed array rewriting P systems by extending the notion of string rewriting P systems to arrays (2003). A theoretical model for picture generation using context-free iso-array grammar rules and puzzle iso-array grammar rules are introduced by Kalyani et al. (2004, 2006). Also iso-array rewriting P systems for iso-picture languages have been studied by Annadurai et al. (2008). In this paper we consider the context-free iso-array rules and context-free puzzle iso-array rules in iso-array rewriting P systems and examine the generative powers of these P systems

Computing with Membranes and Picture Arrays

Splicing systems were introduced by Tom Head [3] on biological considerations to model certain recombinant behaviour of DNA molecules. An effective extension of this operation to images was introduced by Helen Chandra et al. [5] and H array splicing systems were considered. A new method of applying the splicing operation on images of hexagonal arrays was introduced by Thomas et al. [12] and generated a new class of hexagonal array languages HASSL. On the other hand, P systems, introduced by Paun [6] generating rectangular arrays and hexagonal arrays have been studied in the literature, bringing together the two areas of theoretical computer science namely membrane computing and picture languages. P system with array objects and parallel splicing operation on arrays is introduced as a simple and effective extension of P system with operation of splicing on strings and this new class of array languages is compared with the existing families of array languages. Also we propose another P system with hexagonal array objects and parallel splicing operation on hexagonal arrays is introduced and this new class of hexagonal array languages is compared with the existing families of hexagonal array languages

Control Words of String Rewriting P Systems

P systems with controlled computations have been introduced and investigated in the recent past, by assigning labels to the rules in the regions of the P system and guiding the computations by control words. Here we consider string rewriting cell-like transition P system with label assigned rules working in acceptor mode and compare the obtained family of languages of control words over the rule labels with certain well-known language families. An application to chain code picture generation is also pointed out

A Bio-inspired Model of Picture Array Generating P System with Restricted Insertion Rules

In the bio-inspired area of membrane computing, a novel computing model with a generic name of P system was introduced around the year 2000. Among its several variants, string or array language generating P systems involving rewriting rules have been considered. A new picture array model of array generating $P$ system with a restricted type of picture insertion rules and picture array objects in its regions, is introduced here. The generative power of such a system is investigated by comparing with the generative power of certain related picture array grammar models introduced and studied in two-dimensional picture language theory. It is shown that this new model of array P system can generate picture array languages which cannot be generated by many other array grammar models. The theoretical model developed is for handling the application problem of generation of patterns encoded as picture arrays over a finite set of symbols. As an application, certain floor-design patterns are generated using such an array $P$ system

The Complexity of Infinite Computations In Models of Set Theory

We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are \pi_2^0-sets, while in a different model of ZFC both are analytic but non Borel sets. This shows that the topological complexity of an \omega-language accepted by a 1-counter B\"uchi automaton or of an infinitary rational relation accepted by a 2-tape B\"uchi automaton is not determined by the axiomatic system ZFC. We show that a similar result holds for the class of languages of infinite pictures which are recognized by B\"uchi tiling systems. We infer from the proof of the above results an improvement of the lower bound of some decision problems recently studied by the author

Painting and Language: A Pictoral Syntax of Shapes

In previous articles, the author proposed that paintings can have syntactic rules. In this article he develops his proposal further and shows that shapes act as syntactic elements in the languages of painting styles. He meets Nelson Goodman\u27s objections to his proposal by showing that shapes meet the criterion of syntactic discreteness proposed by the latter to separate linguistic from other symbolic systems. His approach is to specify style as the domain of a language of painting, to show that style is syntactical and to argue that shapes are the primitive syntactic elements of style. His essay relates current research on the development of syntax for picture-reading machines to the question of syntax for paintings

Neural overlap of L1 and L2 semantic representations across visual and auditory modalities : a decoding approach/

This study investigated whether brain activity in Dutch-French bilinguals during semantic access to concepts from one language could be used to predict neural activation during access to the same concepts from another language, in different language modalities/tasks. This was tested using multi-voxel pattern analysis (MVPA), within and across language comprehension (word listening and word reading) and production (picture naming). It was possible to identify the picture or word named, read or heard in one language (e.g. maan, meaning moon) based on the brain activity in a distributed bilateral brain network while, respectively, naming, reading or listening to the picture or word in the other language (e.g. lune). The brain regions identified differed across tasks. During picture naming, brain activation in the occipital and temporal regions allowed concepts to be predicted across languages. During word listening and word reading, across-language predictions were observed in the rolandic operculum and several motor-related areas (pre- and postcentral, the cerebellum). In addition, across-language predictions during reading were identified in regions typically associated with semantic processing (left inferior frontal, middle temporal cortex, right cerebellum and precuneus) and visual processing (inferior and middle occipital regions and calcarine sulcus). Furthermore, across modalities and languages, the left lingual gyrus showed semantic overlap across production and word reading. These findings support the idea of at least partially language- and modality-independent semantic neural representations