|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc050301,
author = {Csuhaj-Varj\'{u}, Erzs\'{e}bet},
title = {Parallel Communicating Grammar Systems with Bounded
Resources: Results, Techniques, Open Problems},
journal = jalc,
year = 2000,
volume = 5,
number = 3,
pages = {175--190},
keywords = {parallel communicating grammar systems, size complexity,
recursively enumerable languages},
abstract = {Parallel communicating grammar systems (PC grammar
systems) are language theoretical models for distributed
computation. In a PC grammar system several grammars work on
their own sentential forms in parallel and their work is
organized in a communicating system to generate a single
language. In this paper we summarize some important results
on those classes of parallel communicating grammar systems
where the component grammars are with bounded resources
(with size parameters bounded by constants). We demonstrate
that these economically presented systems are powerful tools
for language generation, even the class of recursively
enumerable languages can be obtained by classes of some
variants.}
}