@article{ITA_1997__31_4_331_0, author = {Dumitrescu, S. and P\u{a}un, G.}, title = {On the power of parallel communicating grammar systems with right-linear components}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {331--354}, publisher = {EDP-Sciences}, volume = {31}, number = {4}, year = {1997}, mrnumber = {1605785}, zbl = {0892.68058}, language = {en}, url = {http://archive.numdam.org/item/ITA_1997__31_4_331_0/} }
TY - JOUR AU - Dumitrescu, S. AU - Păun, G. TI - On the power of parallel communicating grammar systems with right-linear components JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1997 SP - 331 EP - 354 VL - 31 IS - 4 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1997__31_4_331_0/ LA - en ID - ITA_1997__31_4_331_0 ER -
%0 Journal Article %A Dumitrescu, S. %A Păun, G. %T On the power of parallel communicating grammar systems with right-linear components %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1997 %P 331-354 %V 31 %N 4 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1997__31_4_331_0/ %G en %F ITA_1997__31_4_331_0
Dumitrescu, S.; Păun, G. On the power of parallel communicating grammar systems with right-linear components. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 4, pp. 331-354. http://archive.numdam.org/item/ITA_1997__31_4_331_0/
1. The computational complexity of PCGS with regular components, Proc. of Developments in Language Theory Conf., Magdeburg, 1995. | Zbl
,2. Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994. | MR | Zbl
, , and ,3. Regulated Rewriting in Formal Language Theory, Springer, Berlin, Heidelberg, 1989. | MR | Zbl
and ,4. Generating languages in a distributed way: Grammar Systems, in Handbook of Formal Languages (G.Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, Heidelberg, 1997. | MR
, and ,5. Non-returning PC grammar systems can be simulated by returning systems, Theoretical Computer Sci., 1996, 165, pp. 463-474. | MR | Zbl
,6. Pattern languages versus parallel communicating grammar systems, Intern. J. Found. Computer Sci., to appear. | Zbl
, and ,7. The Mathematical Theory of Context-free Languages, McGraw Hill Book Comp., New York, 1996. | MR | Zbl
,8. Petri nets algorithms in the theory of matrix grammars, Acta Informatica, 1994, 31, pp. 719-728. | MR | Zbl
and ,9. Matrix grammars versus parallel communicating grammar systems, in vol. Mathematical Aspects of Natural and Formal Languages (Gh. PfUN, ed.), World Sci. Publ., Singapore, 1994, pp. 293-318.
,10. On the generative capacity of parallel communicating grammar systems with regular components, Computers and AI, 1996, 75, pp. 155-172. | MR | Zbl
,11. Parallel communicating grammar systems: the regular case, Ann. Univ. Buc., Series Matem.-Inform., 1989, 38, pp. 55-63. | MR | Zbl
and ,12. Formal Languages, Academic Press, New York, 1973. | MR | Zbl
,