Parallel communicating grammar systems

Results 221 to 230 of about 770 (231)

Some of the next articles are maybe not open access.

Non-centralized parallel communicating grammar systems

Bull. EATCS, 1990
Summary: The main aim of this note is to introduce to the reader a subject which seems to deserve some attention: the parallel communicating grammar systems (defined in \textit{Gh. Pǎun} and \textit{L. Sâuteau} [An. Univ. Bucar., Mat. 38(2), 55-63 (1989)] as a grammatical model of parallel commuting).
openaire +1 more source

On the computational complexity of context-free Parallel Communicating Grammar Systems

1997
In 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

Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems

J. Autom. Lang. Comb., 2000
Journal of Automata, Languages and Combinatorics, Volume 5, Number 3, 2000, 175 ...
openaire +2 more sources

Parallel Communicating Grammar Systems

2018
Erzsébet Csuhaj-Varjú +3 more
openaire +1 more source

ON A VARIANT OF PARALLEL COMMUNICATING GRAMMAR SYSTEMS WITH COMMUNICATION BY COMMAND

2006
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +1 more source

Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System

2013
Stefan D Bruda
exaly

Parallel Communicating Graph Grammar

2011
exaly

Parallel Communicating Grammar Systems as a Turing-Complete Model

2019
openaire +1 more source