Results 211 to 220 of about 60,674 (237)
Some of the next articles are maybe not open access.
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
Learning Subclasses of Parallel Communicating Grammar Systems
2010Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper an algorithm to learn a parallel communicating grammar system in which the master component is a regular grammar and the other components are pure pattern grammars is given.
Sindhu J. Kumaar +2 more
openaire +1 more source
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
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