Some decision problems for parallel communicating grammar systems

Ferucio Laurentiu Tiplea, Cristian Ene, Cecilia Magdalena Ionescu, Octavian Procopiuc
1994 Theoretical Computer Science  
Tiplea, F.L., C. Ene, C.M. Ionescu and 0. Procopiuc, Some decision problems for parallel communicating grammar systems, Theoretical Computer Science 134 (1994) 365-385. In this paper we investigate several decision problems for parallel communicating grammar systems: the enabling, circularity, centralizing, conflict-freeness, boundedness, membership, equivalence, inclusion, emptiness and finiteness problems. The first five problems are shown to be decidable for context-free PCS's but
more » ... for the context-sensitive case. The last five problems are only studied for the context-sensitive case and they are shown to be undecidable. 0304-3975/94/$07.00 0 1994-Elsevier Science B.V. All rights reserved SSDI 0304-3975(93)E0210-U 366 F. Laurentiu et al. communication network, parallel architectures, developmental systems, neuronal systems, artificial intelligence, to name a few. The increasing complexity of man-made systems, made possible by the widespread application of computer technology, has taken such systems to a level of complexity where more detailed formal methods become necessary for their analysis and design. Parallel communicating grammar systems (PCS, for short) are a new model of the parallel processing [IS] and they are aimed to combine the notions of parallelism and communication into a suitable model for theoretical investigations. These systems have evolved from the following considerations: l knowledge processing systems are characterized by an intimate cooperation be-
doi:10.1016/0304-3975(94)90243-7 fatcat:nh5limleabfcvpxhj3spmcn7xy