Results 211 to 220 of about 672 (226)

Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems

2008
It is well known that certain language families generated by cooperating distributed (CD) grammar systems can be characterized in terms of context-free random context grammars. In particular, the language families generated by CD grammar systems working in the t- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently
Henning Bordihn, Markus Holzer 0001
openaire   +1 more source

Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features

2017
Motivated by the problem of tiling the plane, puzzle grammars were introduced as a mechanism for generating languages of picture arrays in the two-dimensional plane. On the other hand BPG array P system with array objects and basic puzzle grammar (BPG) rules was introduced as a variant of array generating P systems that were developed with a view to ...
Pradeep Isawasan, Ravie Chandren Muniyandi, Ibrahim Venkat, K. G. Subramanian 0001   +3 more
openaire   +2 more sources

The Graph Isomorphism Problem and the GI-Completeness of Selected Problems from Context-Free Grammars and Rewrite Systems

2021
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire   +1 more source

Teams in grammar systems: hybridity and weak rewriting

Acta Cybern., 1996
Summary: Some new ideas in the theory of teams in grammar systems are introduced and studied. Traditionally, a team is formed from a finite number of sets of productions, and in every derivation step one production from each component is used to rewrite a symbol of the sentential form. Hence rewriting is done in parallel.
openaire   +4 more sources

Rewriting Systems and Grammars

1999
openaire   +1 more source

GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING

International Journal of General Systems, 1979
Karel Culik, Aristid Lindenmayer
exaly  

Uniform rewriting based on permutations

International Journal of Computer Mathematics, 1998
Alexander Meduna
exaly  

On sequential and parallel node-rewriting graph grammars

Computer Graphics and Image Processing, 1982
R Verraedt, D Janssens
exaly  

Accepting grammars with regulation

International Journal of Computer Mathematics, 1994
Henning Fernau, Henning Bordihn
exaly  

Independent parallelism in finite copying parallel rewriting systems

Theoretical Computer Science, 1999
Giorgio Satta
exaly