Summary.
We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that right-linear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular sets and under homomorphisms) and union; a slight variant is, in addition, closed under concatenation and star; their power lies between that of n-parallel grammars introduced by Wood and that of matrix languages of index n, and their relation to equal matrix grammars of degree n is discussed. We show that membership for these language classes is complete for NL. In a second part of the paper, we discuss questions concerning grammatical inference of these systems. More precisely, we show that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 12 April 2000 / 16 October 2000
Rights and permissions
About this article
Cite this article
Fernau, H. Parallel communicating grammar systems with terminal transmission. Acta Informatica 37, 511–540 (2001). https://doi.org/10.1007/PL00013312
Issue Date:
DOI: https://doi.org/10.1007/PL00013312