Results 171 to 180 of about 64,921 (192)
Some of the next articles are maybe not open access.
Parallel communicating grammar systems with terminal transmission
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Parallel communicating grammar systems with communication by signals
1997We consider PC grammar systems with communication by request, but with the communicated strings defined dynamically, according to certain regular languages associated to system components (like in CCPC grammar systems). The power of such systems is investigated.
openaire +1 more source
On the Regularity of Languages Generated by Parallel Communicating Grammar Systems
J. Autom. Lang. Comb., 1996Journal of Automata, Languages and Combinatorics, Volume 1, Number 3, 1996, 181 ...
openaire +2 more sources
Further Remarks on Parallel Communicating Grammar Systems without a Master
J. Autom. Lang. Comb., 2000Journal of Automata, Languages and Combinatorics, Volume 5, Number 1, 2000, 59 ...
openaire +2 more sources
On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems
2001openaire +3 more sources
Parallel Processing Letters, 2016
Coverability trees offer a finite characterization of all the derivations of a context-free parallel grammar system (CF-PCGS). Their finite nature implies that they necessarily omit some information about these derivations. We demonstrate that the omitted information is most if not all of the time too much, and so coverability trees are not useful as ...
Stefan D. Bruda, Mary Sarah Ruth Wilkin
openaire +1 more source
Coverability trees offer a finite characterization of all the derivations of a context-free parallel grammar system (CF-PCGS). Their finite nature implies that they necessarily omit some information about these derivations. We demonstrate that the omitted information is most if not all of the time too much, and so coverability trees are not useful as ...
Stefan D. Bruda, Mary Sarah Ruth Wilkin
openaire +1 more source
Non-centralized parallel communicating grammar systems
Bull. EATCS, 2020Summary: 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 +1 more source
ON CENTRALIZED PARALLEL COMMUNICATING GRAMMAR SYSTEMS WITH CONTEXT-SENSITIVE COMPONENTS
International Journal of Foundations of Computer Science, 2013Centralized parallel communicating grammar systems with context-sensitive components that work in returning mode can only generate context-sensitive languages. Here we show that, when working in nonreturning mode, these grammar systems generate all languages from the nondeterministic time complexity class NEXT = ∪c ≥ 1 NTIME (2c·n).
openaire +1 more source
On the syntactic complexity of parallel communicating grammar systems
Kybernetika, 1992Summary: 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
2011In 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 +1 more source