Results 221 to 230 of about 12,114,445 (243)
Some of the next articles are maybe not open access.

Parallel Communication Synchronized Pure Pattern Grammar Systems with Filters

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011
Motivated by the study of pure pattern grammars by Abisha et al (2000), and parallel communicating grammar systems with communication by commands of Csuhaj -- Varju et al (2006), a new generative device, herein after referred as parallel communicating synchronizing pure pattern grammar systems with filters is introduced.
Sindhu J. Kumaar, P. J. Abisha
openaire   +2 more sources

Parallel communicating grammar systems with terminal transmission

Acta Informatica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Regularity of Languages Generated by Parallel Communicating Grammar Systems

J. Autom. Lang. Comb., 1996
Journal of Automata, Languages and Combinatorics, Volume 1, Number 3, 1996, 181 ...
openaire   +3 more sources

A coverability structure for parallel communicating grammar systems

J. Inf. Process. Cybern., 1993
Summary: We prove that certain questions (including the circular query problem) about nonreturning context-free parallel communicating grammar systems are recursively solvable, and for this purpose we use some techniques of vector addition systems.
Ferucio Laurentiu Tiplea, Cristian Ene
openaire   +2 more sources

Further Remarks on Parallel Communicating Grammar Systems without a Master

J. Autom. Lang. Comb., 2000
Journal of Automata, Languages and Combinatorics, Volume 5, Number 1, 2000, 59 ...
openaire   +2 more sources

On the syntactic complexity of parallel communicating grammar systems

Kybernetika, 1992
Summary: We compare the complexity of generating a language by a context-free grammar or by a parallel communicating grammar system (PCGS), in the sense of Gruska's measures Var, Prod, Symb. Then we define a specific measure of PCGS, Com, dealing with the number of communication symbols appearing in a derivation.
openaire   +2 more sources

On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems

2011
In this paper, we study the size complexity of nonreturning parallel communicating grammar systems. First we consider the problem of determining the minimal number of components necessary to generate all recursively enumerable languages. We present a construction which improves the currently known best bounds of seven (with three predefined clusters ...
Erzsébet Csuhaj-Varjú, György Vaszil
openaire   +2 more sources

Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views

2013
The paper brings new insights into the complexity of Szilard languages (SZLs) of Parallel Communicating Grammar Systems (PCGSs). We investigate the structure of Szilard words for several classes of PCGSs with context-free rules. We prove that the classes of SZLs of returning centralized and non-returning non-centralized PCGSs are included in circuit ...
Liliana Cojocaru, Erkki Mäkinen
openaire   +2 more sources

Non-centralized parallel communicating grammar systems

Bull. EATCS, 1990
Summary: The main aim of this note is to introduce to the reader a subject which seems to deserve some attention: the parallel communicating grammar systems (defined in \textit{Gh. Pǎun} and \textit{L. Sâuteau} [An. Univ. Bucar., Mat. 38(2), 55-63 (1989)] as a grammatical model of parallel commuting).
openaire   +2 more sources

On the computational complexity of context-free Parallel Communicating Grammar Systems

1997
In this paper we investigate the computational complexity for Parallel Communicating Grammar Systems (PCGSs) whose components are context-free grammars. We show that languages generated by nonreturning context-free PCGSs can be recognized by O(n) space-bounded Turing machines.
openaire   +1 more source

Home - About - Disclaimer - Privacy