83 research outputs found

    Array P Systems and t−Communication

    Get PDF
    The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication mode called t−mode of cooperating distributed grammar systems. On the other hand cooperating array grammar systems [5]and array P systems [1] have been developed in the context of two-dimensional picture description. In this paper, motivated by the study of [4], these two systems are studied by linking them through the t−communication mode, thus bringing out the picture description power of these systems

    Array Tissue-like P Systems

    Get PDF
    Array grammars have been studied in the framework of Membrane Comput- ing by using rewriting rules from transition P systems. In this paper we present a new approach to dealing with array grammars by using tissue-like P systems and present an application to the segmentation of images in two dimensional computer graphics.Ministerio de Ciencia e Innovación TIN2008-04487-EMinisterio de Ciencia e Innovación TIN-2009-13192Junta de Andalucía P08-TIC-0420

    Two-dimensional grid grammars

    Get PDF
    Everyone has an intuitive understanding of the concept of an algorithm. It is generally agreed that an algorithm, or effective procedure, is a finite set of instructions which meet certain requirements. All instructions must be unambiguous and must not involve any element of chance. Each instruction must be executed in a finite amount of time. It is usually not required that algorithms halt. Instead, the set of instructions must be so specifically stated that any two people executing them would perform precisely the same operations. In this thesis we first introduce a class of mathematical machines which are used to define the concept of an algorithmic computation. These Turing machines [3], which operate on one-dimensional tapes, are defined in Chapter II. We consider machines as computational devices, function evaluators, and acceptor automata for syntactically correct input. A set of instructions, called the Wang programming language, which can be assembled in such a way as to simulate a given Turing machine, is presented in Chapter III. In Chapter IV we define grammars, which are systems for generating strings of symbols with certain structured properties. The Chomsky Hierarchy of classes of restricted grammars is outlined [1]. In Chapter V we introduce a class of machines which operate in a manner similar to Turing machines but on a two-dimensional tape. We refer to this class of machines as grid machines

    Acta Cybernetica : Tomus 3. Fasciculus 4.

    Get PDF

    Generating similar images using bag context picture grammars

    Get PDF
    A Dissertation submitted to the Faculty of Science in partial fulfilment of the requirements for the degree of Master of Science University of the Witwatersrand, Johannesburg, February 2018Formal language theory was born in the middle of the 20th century as a tool for modeling and investigating syntax of natural languages. It was developed in connection with the handling of programming languages. Bag context grammars are a fairly new grammar class where bag context tree grammars have been defined. Bag context is used to regulate rewriting in tree grammars. In this dissertation we use bag context to regulate rewriting in picture grammars and thus to generate similar pictures. This work is exploratory work since bag context picture grammars have not been defined. We use examples to show how bag context picture grammars can be used to generate pictures. In this work bag context picture grammars are defined and used to generate similar pictures. Pictures generated by random context picture grammars and three of their sub-classes are selected and bag context picture grammars are used to generate the same pictures to those selected. A lemma is defined that is used to convert the class of random context picture grammars and three of their sub-classes into equivalent bag context picture grammars. For each grammar selected, an equivalent bag context picture grammar is created and used to generate several pictures that are similar to each other. Similarity is defined by noting small differences that are seen in pictures that belong to the same gallery. In this work we generate similar pictures with bag context picture grammars and thus make the discovery that bag context gives a certain level of control in terms of rules applied in a grammar.XL201

    On derivation languages of a class of splicing systems

    Get PDF
    Derivation languages are language theoretical tools that describe halting derivation processes of a generating device. We consider two types of derivation languages, namely Szilard and control languages for splicing systems where iterated splicing is done in non-uniform way defined by Mitrana, Petre and Rogojin in 2010. The families of Szilard (rules and labels are mapped in a one to one manner) and control (more than one rule can share the same label) languages generated by splicing systems of this type are then compared with the family of languages in the Chomsky hierarchy. We show that context-free languages can be generated as Szilard and control languages and any non-empty context-free language is a morphic image of the Szilard language of this type of system with finite set of rules and axioms. Moreover, we show that these systems with finite set of axioms and regular set of rules are capable of generating any recursively enumerable language as a control language

    Picture languages generated by splicing and assembling til·les

    Get PDF
    Idiomes imatge generats per Empalme i Muntatge Rajoles. L'extensió de l'estudi de les llengües oficials sobre el cas string 2 idiomes dimensionals o idiomes imatge ha estat d'interès per molt temps per les seves vastes aplicacions. En la tesi i l'objecte de dues dimensions més comú estudiat és una imatge que és una matriu rectangular de símbols presos a partir d'un alfabet finit. L 'objectiu d'aquesta tesi se centra en l'estudi de la generació de les classes d'idiomes d'imatge per les operacions de bio-inspirats saber, `Enllaç' i` Auto-Assemblea 'd'ADN-Computing. És a dir, sistema d'entroncament i enrajolats Regla Sistemes H-Array. H-array Empalme Sistema és un formalisme bio-inspirat estès des H-entroncament de la caixa de cadena, un estudi àmpliament investigat introduït per T. Head. Està estructurat com un mecanisme mitjançant l'estudi de les gramàtiques lineals de dues dimensions correctes. Aquest formalisme és un mecanisme que s'aplica al número finit d'imatges trucades imatges inicials amb determinat conjunt de regles d'entroncament de dòmino de columna i fila. El lloc de context en el qual les dues imatges es tallen en columnes i files es va decidir per la seqüència de dòmino adjacents en el conjunt de regles. I llavors el `enganxar 'de la primera part de la imatge a la segona part de la imatge es realitza mitjançant la columna i fila concatenacions respectivament. L'H-Array Enllaç Sistemes s'aplica sobre llengües 2D-RLG generant idiomes Enllaç H-Array (HASL). A continuació, les classes de restricció definides i d'estudi són acte Creu sobre matrius i llenguatges Empalme matriu simples i resultats incomparables es va demostrar amb 2D-RLG, HASL. No són disjunts i es creuen llenguatges recognoscibles. El segon formalisme principal introduït i estudiat a la tesi és Revestiments Sistema de regles . Aquest formalisme genera la imatge pel conjunt de regles de mosaic, muntatge rajoles. Hem demostrat que la classe de L (TS) (Sistema d'enrajolat, llenguatge reconeixible) està continguda en TRuS. A més, vam demostrar existeixen una construcció del formalisme basat en la generació d'imatges en files o columnes que és equivalent a L (TS). L'equivalència es demostra l'ús de sistemes de Wang. Així que porta a una idea interessant d funcionament bio-inspirat (auto-acoblament) a la generació de la imatge.Idiomas de imagen generados por Empalme y Montaje Azulejos. La extensión del estudio de las lenguas oficiales sobre el caso string dos idiomas dimensionales o idiomas imagen ha sido de interés por mucho tiempo por sus vastas aplicaciones. En la tesis y el objeto de dos dimensiones más común estudiado es una imagen que es una matriz rectangular de símbolos tomados a partir de un alfabeto finito. E l objetivo de esta tesis se centra en el estudio de la generación de las clases de idiomas de imagen por las operaciones de bio-inspirados saber, `Empalme 'y` Auto-Asamblea' de ADN-Computing. A saber, sistema de empalme H-Array y sistemas de regla de mosaico. H-array Empalme Sistema es un formalismo bio-inspirado extendido desde H-empalme de la caja de cadena, un estudio ampliamente investigado introducido por T. Head. Está estructurado como un mecanismo mediante el estudio de las gramáticas lineales de dos dimensiones correctas. Este formalismo es un mecanismo que se aplica en el número finito de imágenes llamadas imágenes iniciales con determinado conjunto de reglas de empalme de dominó de columna y fila. El sitio de contexto en el que las dos imágenes se cortan en columnas y filas se decidió por la secuencia de dominós adyacentes en el conjunto de reglas. Y entonces el `pegar 'de la primera parte (o sub-array) de la imagen a la segunda parte de la imagen se realiza mediante la columna y fila concatenaciones respectivamente. El H-Array Empalme Sistemas se aplica sobre lenguas 2D-RLG generando idiomas Empalme H-Array (HASL). A continuación, las clases de restricciones definidas y de estudio son auto Cruz sobre matrices y lenguajes Empalme matriz simples y resultados incomparables se demostró con 2D-RLG, HASL. No son disjuntos y se cruzan lenguajes reconocibles. El segundo formalismo principal introducido y estudiado en la tesis son Revestimientos Sistema de reglas TRuS. Este formalismo genera la imagen por el conjunto de reglas de mosaico, montajes azulejos. Hemos demostrado que la clase de L (TS) (Sistema de alicatado, lenguaje reconocible) está contenida en la TRuS. Además, demostramos existen una construcción del formalismo basado en la generación de imágenes en filas o columnas que es equivalente a L (TS). La equivalencia se demuestra el uso de sistemas de Wang.Picture languages generated by Splicing and Assembling Tiles. The extension of the study of formal languages over string case to two dimensional languages or picture languages has been of interest for long for its vast applications. In the thesis and the most common two-dimensional object studied is a picture which is a rectangular array of symbols taken from a finite alphabet. T he objective of this thesis concentrates on the study of generation of Picture language classes by bio-inspired operations namely, `Splicing' and `Self-Assembly' of DNA-Computing. Namely, H-Array Splicing System and Tiling Rule Systems. H-array Splicing Systems is a bio-inspired formalism extended from H-Splicing from string case, a vastly investigated study introduced by T. Head. In particular it is structured as a mechanism by studying two-dimensional right linear grammars. In elaborate this formalism is a mechanism which is applied on finite number of pictures called initial pictures with given set of column and row domino splicing rules. The context site where the two pictures are cut in columns and rows are decided by the sequence of adjacent dominoes in the set of rules. And then the `pasting' of the first part (or sub-array) of the picture to the second part of the picture is done by column and row concatenations respectively. The H-Array Splicing Systems is applied over 2D-RLG languages generating H-Array Splicing languages (HASL). Then the restriction classes defined and study are Self Cross over Arrays and Simple Array Splicing languages and incomparable results are proved with 2D-RLG, HASL. They are not disjoint and they intersect Recognizable languages. Another and the second main formalism introduced and studied in the thesis is Tiling Rule System TRuS . This formalism generates picture by set of tiling rules, assembling tiles. We have proved that the class of L(TS) (Tiling System, recognizable language) is contained in TRuS . Also, we prove there exist a construct of the formalism based on generating pictures in rows or columns which is equivalent to L(TS). The equivalence is proved using Wang systems. Thus leading to an interesting notion of bio-inspired (self-assembling) operation to picture generation
    corecore