Parallel communicating grammar systems: Recent results, open problems

Acta Cybernetica

Volumn 12, Issue 4, 1996, Pages 381-395

  Pǎun, Gheorghe ^a  

^a INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000316575     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. B. Baker, R. Book, Reversal-bounded multipushdown machines, J. Computer System Sci., 8 (1974), 315-332.
2. L. Cai, The computational complexity of PCGS with right-linear components, Proc. Conf. DLT, Magdeburg, 1995, World Sci. Publ., Singapore, 1996, 209-219.
3. L. Cai, The computational complexity of linear PCGS, Computers and AI, 15, 2-3 (1996), 199-210.
4. E. Csuhaj-Varjú, J. Dassow, On cooperating distributed grammar systems, J. Inf. Process. Cybern., EIK, 26, 1-2 (1990), 49-63.
5. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Pǎun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.
6. E. Csuhaj-Varjú, J. Kelemen, Gh. Pǎun, Grammar systems with WAVE-like communication, Computers and AI, 15, 5 (1996), 419-436.
7. J. Dassow, Gh. Pǎun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, 1989.
8. J. Dassow, Gh. Pǎun, G. Rozenberg, Grammar systems, in Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Heildeberg, 1996.
9. S. Dumitrescu, Non-returning PC grammar systems can be simulated by returning systems, Theor. Computer Sci., 165 (1996), 463-474.
10. S. Dumitrescu, Gh. Pǎun, On the power of PC grammar systems with right-linear rules, submitted, 1996.
11. J. Engelfriet, G. Rozenberg, Fixed point languages and representations of recursively enumerable languages, Journal of the ACM, 27, 3 (1980), 499-518.
12. R. Freund, Gh. Pǎun, C. M. Procopiuc, O. Procopiuc, Parallel communicating grammar systems with context-sensitive components, in Artificial Life. Grammatical Models (Gh. Pǎun, ed.), Black Sea Univ. Press, Bucharest, 1995, 166 -174.
13. O. Ibarra, Simple matrix languages, Inform. Control, 17 (1970), 359-394.
14. L. Ilie, A. Salomaa, 2-testability and relabeling produce everything, submitted, 1995.
15. J. Kari, L. Sântean, The impact of the number of cooperating grammars on the generaive power, Theor. Computer Sci., 98 (1992), 249-263.
16. M. Latteux, B. Leguy, B. Ratoandromanana, The family of one-counter languages is closed under quotient, Acta Informatica, 22 (1985), 579-588.
17. V. Mihalache, Matrix grammars versus parallel communicating grammar systems, in Mathematical Aspects of Natural and Formal Languages (Gh. Pǎun, ed ) World Sci. Publ., Singapore, 1994, 293-318.
18. V. Mihalache, On parallel communicating grammar systems with context-free rules, in vol. Mathematical Lingusitics and Related Topics (Gh. Pǎun, ed,), Ed. Academiei, Bucureşti, 1995, 147-160.
19. V. Mihalache, Parallel communicating grammar systems with query words, Ann. Univ. Buc., Matem.-Inform. Serzes, 45, 1 (1996), 81-93.
20. V. Mihalache, On the generative capacity of PCGS with regular components, Computers and AI, 15, 2-3 (1996), 27-36.
21. Gh. Pǎun, Grammar systems: a grammatical approach to distribution and cooperation, ICALP '95, LNCS 944 (Z. fülöp, F. Gécseg, eds.), Springer-Verlag, 1995, 429-443.
22. Gh. Pǎun, Parallel communicating grammar systems. A survey, Proc. XI Congress on Natural and Formal Languages, Tortosa, 1995 (C. Martin-Vide, ed.), 257-283.
23. Gh. Pǎun, Characterizations of recursively enumerable languages by means of grammar systems, submitted, 1996.
24. Gh. Pǎun, L. Sântean, Parallel communicating grammar systems: the regular case, Ann. Univ. Buc., Series Matem.-Inform., 38 (1989), 55-63.
25. O. Procopiuc, C. M. Ionescu, F. L. Ţiplea, Parallel communicating grammar systems: the context-sensitive case, Intern. J. Computer Math., 49 (1993), 145 -156.
26. G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.
27. A. Salomaa, Formal Languages, Academic Press, New York, 1973.
28. A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, Maryland, 1981.
29. Gy. Vaszil, Linear non-returning PCGS can be simulated by returning PCGS, manuscript, 1996.