Results 161 to 170 of about 64,921 (192)
Some of the next articles are maybe not open access.
ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
International Journal of Foundations of Computer Science, 2007A 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
Parallel Communicating Grammar Systems with Incomplete Information Communication
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +2 more sources
Parallel Communicating Grammar Systems As Language Analyzers
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn +2 more
openaire +2 more sources
On the synchronization in parallel communicating grammar systems
Acta Informatica, 1993The power of various types of synchronization in parallel communication grammar systems is investigated. These systems were introduced by the author and \textit{L. Santean} [Ann. Univ. Bucuresti, Series Matem.-Inform., 38, No. 2, 55-63 (1989; Zbl 0749.68048)] and consist of more Chomsky grammars working together for generating one language.
openaire +2 more sources
Bounded communication in parallel communicating grammar systems
J. Inf. Process. Cybern., 2020Summary: We consider parallel grammar systems with a bounded number of communications in any derivation (bounded PCGS) and we study their computational power. Thus, a pumping lemma for such systems is established and infinite hierarchies are obtained. Finally, the languages generated by \(k\)-bounded centralized PCGS of degree 2 are shown to be \((k+ 1)
Cecilia Magdalena Ionescu +1 more
openaire +1 more source
Translations by Regulated Parallel Communicating Grammar Systems
J. Autom. Lang. Comb., 2011Parallel communicating grammar systems (PCGSs) and their regulated variant (RPCGSs) generate languages. We introduce a translation as a binary relation between the words generated simultaneously by two components of such a system. Using sample translations corresponding to the distributive law from algebra we show that RPCGSS can generate a hierarchy ...
Dana Pardubská +2 more
openaire +1 more source
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems
J. Autom. Lang. Comb., 1997This paper deals with regular Parallel Communicating Grammar Systems (PCGS, for short) as introduced in [12], and basically it has two main parts. The first one introduces and studies processes and partial words of PCGS, while the second one gives some vectorial characterizations of sequential languages of PCGS.
Ferucio Laurentiu Tiplea +2 more
openaire +2 more sources
Pattern Languages Versus Parallel Communicating Grammar Systems
International Journal of Foundations of Computer Science, 1997We compare the power of two (fairly different) recently investigated language identifying devices: patterns and parallel communicating (PC) grammar systems. The simulation of multi-patterns by context-free PC grammar systems is rather obvious, but, unexpectedly, this can be realized also by (non-centralized) PC grammar systems with right-linear ...
Sorina Dumitrescu +2 more
openaire +2 more sources
A coverability structure for parallel communicating grammar systems
J. Inf. Process. Cybern., 2020Summary: 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 +1 more source