Results 11 to 20 of about 700 (231)
Tile Rewriting Grammars and Picture Languages
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into a isometric one tiled with specified tiles.
Matteo Pradella, Stefano Crespi Reghizzi
exaly +2 more sources
Graph Grammars With String-Regulated Rewriting [PDF]
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have
Jürgen Dassow +2 more
exaly +3 more sources
m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars [PDF]
This paper presents a coding of m-linear context-free rewriting systems (m-LCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.
de Groote, Philippe, Pogodalla, Sylvain
openaire +2 more sources
Continuous Grammars ; CU-CS-162-79 [PDF]
In this paper we continue the study of selective substitution grammars which form a framework for most of the rewriting systems studied in the literature.
Rozenberg, Grzegorz +1 more
core +6 more sources
Prefix probabilities for linear context-free rewriting systems [PDF]
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio, Nederhof, Mark Jan
core +2 more sources
A Demonstration of the Grrr Graph Rewriting Programming Language [PDF]
This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described.
Rodgers, Peter +3 more
core +1 more source
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning [PDF]
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics.
Noah A. Smith +3 more
core +1 more source
Reorganization in Multi-Agent Architectures: An Active Graph Grammar Approach
Background: Organizational architecture is a holistic approach to design of humane organizations and studies an organization from five perspectives: structure, culture, processes, strategy and individuals.
Schatten Markus
doaj +1 more source
Accepting grammars and systems [PDF]
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited ...
Bordihn, Henning, Fernau, Henning
core +1 more source
On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms [PDF]
http://www.springerlink.com/content/1572-9583/We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars.
Pogodalla, Sylvain, de Groote, Philippe
core +1 more source

