论文信息 - On the descriptional complexity of metalinear cd grammar systems

On the descriptional complexity of metalinear cd grammar systems

Metalinear CD grammar systems are context-free CD grammar systems where each component consists of metalinear productions. The maximal number of nonterminals in all starting productions is referred...

Bettina Sunckel

[1] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[2] Sheila A. Greibach,et al. The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.

[3] Andreas Malcher,et al. Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[4] Andreas Malcher. Descriptional Complexity of Cellular Automata and Decidability Questions , 2001, DCFS.

[5] Henning Bordihn,et al. On Descriptions of Context-Free Languages by CD Grammar Systems , 2001, DCFS.