Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System [PDF]
, 2013 Stefan D Bruda
exaly +2 more sources
Related searches:
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
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
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
On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems
2001Csuhaj-Varju Erzsébet
openaire +3 more sources
Bounded communication in parallel communicating grammar systems
J. Inf. Process. Cybern., 1994Summary: 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
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
Parallel communicating grammar systems with terminal transmission
Acta Informatica, 2001zbMATH 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., 1996Journal of Automata, Languages and Combinatorics, Volume 1, Number 3, 1996, 181 ...
openaire +2 more sources