Shuffle on array languages generated by array grammars

Motivated by the studies done by G. Siromoney et al. (1973) and Alexan- dru Mateescu et al. (1998) we examine the language theoretic results related to shuf- fle on trajectories by making use of Siromoney array grammars such as (R : R)AG, (R : C F )AG, (C F : R)AG, (C F : C F )AG, (C S : R)AG, (C S : C S)AG and (C F : C S)AG which are more powerful than the Siromoney matrix grammars (1972) and are used to make digital pictures

Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars

We introduce new possibilities to control the application of rules based on the preceding application of rules which can be de ned for a general model of sequential grammars and we show some similarities to other control mechanisms as graph-controlled grammars and matrix grammars with and without applicability checking as well as gram- mars with random context conditions and ordered grammars. Using both activation and blocking of rules, in the string and in the multiset case we can show computational com- pleteness of context-free grammars equipped with the control mechanism of activation and blocking of rules even when using only two nonterminal symbols

Array Tissue-like P Systems

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

Infinite arrays and infinite computations

AbstractA complete metric topology is introduced on the set of all finite and infinite arrays and the topological properties of the space are studied. In this complete metric topology, infinite arrays are the limits of increasing sequences of finite arrays. The notion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinite arrays, is a subclass of Generalized context-free kolam array grammars. For this class, the finite array language generated by a reduced grammar in Greibach normal form and the set of infinite arrays generated by it are related through the notion of adherence

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

Adjunct hexagonal array token Petri nets and hexagonal picture languages

Adjunct Hexagonal Array Token Petri Net Structures (AHPN) are re- cently introduced hexagonal picture generating devices which extended the Hexag- onal Array Token Petri Net Structures . In this paper we consider AHPN model along with a control feature called inhibitor arcs and compare it with some ex- pressive hexagonal picture generating and recognizing models with respect to the generating power

Pattern matching in compilers

In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. Amethyst is not only a generator of parsers of programming languages, but can also serve as an alternative to tools for matching regular expressions. Our framework also produces dynamic parsers. Its intended use is in the context of IDE (accurate syntax highlighting and error detection on the fly). Amethyst offers pattern matching of general data structures. This makes it a useful tool for implementing compiler optimizations such as constant folding, instruction scheduling, and dataflow analysis in general. The parsers produced are essentially top-down parsers. Linear time complexity is obtained by introducing the novel notion of structured grammars and regularized regular expressions. Amethyst uses techniques known from compiler optimizations to produce effective parsers.Comment: master thesi

Efficient Analysis of Complex Diagrams using Constraint-Based Parsing

This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the data make it possible to efficiently parse real diagrams of substantial complexity. The system is probably the first to demonstrate efficient diagram parsing using grammars that easily be retargeted to other domains. The work assumes that the diagrams are available as a flat collection of graphics primitives: lines, polygons, circles, Bezier curves and text. This is appropriate for future electronic documents or for vectorized diagrams converted from scanned images. The classes of diagrams that we have analyzed include x,y data graphs and genetic diagrams drawn from the biological literature, as well as finite state automata diagrams (states and arcs). As an example, parsing a four-part data graph composed of 133 primitives required 35 sec using Macintosh Common Lisp on a Macintosh Quadra 700.Comment: 9 pages, Postscript, no fonts, compressed, uuencoded. Composed in MSWord 5.1a for the Mac. To appear in ICDAR '95. Other versions at ftp://ftp.ccs.neu.edu/pub/people/futrell