Results 201 to 210 of about 402,233 (248)

COOPERATING ARRAY GRAMMAR SYSTEMS

International Journal of Pattern Recognition and Artificial Intelligence, 1995
The aim of this paper is to elaborate the power of cooperation in generating pictures by array grammars. As it is expected, the generative capacity of cooperating array grammar systems (with a fixed number, with a number greater than a given threshold, or with the maximal number of derivation steps in each component when it is enabled) is strictly ...
Jürgen Dassow, Rudolf Freund, Gheorghe Paun   +2 more
openaire   +1 more source

On a fuzzy theory of grammar system

2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2011
The contribution sketches some ways of how to introduce uncertainty into grammar systems - a syntactic grammar theoretical framework for dealing with decentralized cooperating information processing systems - using the basic concepts of fuzzy set theory.
Jozef Kelemen, Alica Kelemenová
openaire   +1 more source

Multigenerative grammar systems and matrix grammars

Kybernetika, 2010
Summary: Multigenerative grammar systems are based on cooperating context-free grammatical components that simultaneously generate their strings in a rule-controlled or nonterminal-controlled rewriting way, and after this simultaneous generation is completed, all the generated terminal strings are combined together by some common string operations ...
Roman Lukás, Alexander Meduna
openaire   +2 more sources

Determinism in Eco-Grammar Systems

Grammars, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An array grammar programming system

Communications of the ACM, 1973
A package of Fortran programs has been developed that permits a user to interactively design and test array grammars. The user can control the rule selection procedure in a derivation or parse, using weighted programming matrices; he also has a choice of instance selection schemes (raster, random, parallel). Examples are given involving array languages
Andrew Mercer 0002, Azriel Rosenfeld
openaire   +1 more source

Splicing Array Grammar Systems

2005
Splicing Array Grammar Systems (SAGS) generating pictures of rectangular arrays of symbols are introduced. The components consist of two-dimensional tabled matrix Grammars working in parallel and arrays generated in two different components of the SAGS are allowed to be “cut” and “pasted” according to array splicing domino rules.
K. G. Subramanian 0001, A. Roslin Sagaya Mary, K. S. Dersanambika   +2 more
openaire   +1 more source

Grammar systems versus membrane computing: the case of CD grammar systems

Fundam. Informaticae, 2007
Summary: We discuss some relationships between grammar systems and P systems (membrane systems), two areas of computer science dealing with distributed computing models, but with different motivations and different types of basic ingredients. We extend one of the most important communication protocols of cooperating distributed (CD) grammar systems ...
Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil   +2 more
openaire   +2 more sources

ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS

International Journal of Foundations of Computer Science, 2007
A generalization of centralized and returning parallel communicating grammar systems with linear components (linear CPC grammar systems) is studied. It is known that linear CPC grammar systems are more powerful than regular CPC grammar systems and that CPC grammar systems with context-free components are more powerful than linear CPC grammar systems ...
Andreas Malcher, Bettina Sunckel
openaire   +1 more source

Graph grammars for distributed systems

2005
In the paper we define grammars on a class of labeled, partially ordered hypergraphs, called distributed systems. A distributed system models both the spatial and the temporal aspects of a real system through the relations of adjacency and causality. Terminal symbols represent the (deterministic, certain) past history of the system while nonterminal ...
Ilaria Castellani, Ugo Montanari
openaire   +1 more source

PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS

International Journal of Foundations of Computer Science, 2011
We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7
Erzsébet Csuhaj-Varjú, Marion Oswald, György Vaszil   +2 more
openaire   +1 more source