On size complexity of context-free returning parallel communicating grammar systems

Parallel communicating grammar systems with bounded resources

Theoretical Computer Science

On rule-number complexity of components of probabilistic cooperating distributed grammar systems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

PC grammar systems with five context-free components generate all recursively enumerable languages

Theoretical Computer Science

Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components

Journal of Automata, Languages and Combinatorics