Results 181 to 190 of about 64,921 (192)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems
J. Autom. Lang. Comb., 2000Journal of Automata, Languages and Combinatorics, Volume 5, Number 3, 2000, 175 ...
openaire +2 more sources
On the computational complexity of context-free Parallel Communicating Grammar Systems
1997In 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
ON A VARIANT OF PARALLEL COMMUNICATING GRAMMAR SYSTEMS WITH COMMUNICATION BY COMMAND
2006Erzsébet Csuhaj-Varjú, György Vaszil
openaire +1 more source