On the computational completeness of context-free parallel communicating grammar systems

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 349-358

  Csuhaj Varjú, Erzsébet ^a   Vaszil, György ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Computational completeness; Distributed computation; Parallel communicating grammar systems

Indexed keywords

EID: 0346304138     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00193-5     Document Type: Article

References (9)

1. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Pǎun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.
2. J. Dassow, Gh. Pǎun, G. Rozenberg, Grammar systems, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 2, Ch. 4, Springer, Berlin, 1997, pp. 155-213.
3. S. Dumitrescu, Non-returning parallel communicating grammar systems can be simulated by returning systems, Theoret. Comput. Sci. 165 (1996) 463-474.
4. P. C. Fischer, Turing machines with restricted memory access, Inform. Control 9 (1966) 364-379.
5. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
6. N. Mandache, On the computational power of context-free PCGS, submitted.
7. Gh. Pǎun, Parallel communicating grammar systems: recent results, open problems, Acta Cybernet. 12 (1996) 381-395.
8. Gh. Pǎun, L. Santean, Parallel communicating grammar systems: the regular case, Ann. Univ. Bucharest, Ser. Matem.-Inform. 38(2) (1989) 55-63.
9. A. Salomaa, Formal Languages, Academic Press, New York, 1973.