论文信息 - Two Lower Bounds on Distributive Generation of Languages

Two Lower Bounds on Distributive Generation of Languages

The lower bounds on communication complexity measures of language generation by Parallel Communicating Grammar Systems (PCGS) are investigated. The first result shows that there exists a language that can be generated by some dag-PCGS (PCGS with communication structures realizable by directed acyclic graphs) consisting of 3 grammars, but by no PCGS with tree communication structure. The second result shows that dag-PCGS have their communication complexity of language generation either constant or linear.

Jarkko Kari | Lila Kari | Juraj Hromkovic | Dana Pardubská

[1] Jarkko Kari,et al. Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems , 1993, MFCS.

[2] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[3] Lila Santean,et al. Parallel Communicating Systems. , 1990 .

[4] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[5] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.

[6] Jarkko Kari,et al. The Impact of the Number of Cooperating Grammars on the Generative Power , 1992, Theor. Comput. Sci..