Improved Descriptional Complexity Results on Generalized Forbidding Grammars-Reference-Cited by-同舟云学术

Improved Descriptional Complexity Results on Generalized Forbidding Grammars

Published:2019 Issue: Volume: Page:174-188
ISSN:0302-9743
Container-title:Algorithms and Discrete Applied Mathematics
language:
Short-container-title:

Author:

Fernau Henning,Kuppusamy Lakshmanan,Oladele Rufus O.,Raman Indhumathi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-11509-8_15

Reference19 articles.

1. Csuhaj-Varjú, E., Kelemenová, A.: Descriptional complexity of context-free grammar forms. Theoret. Comput. Sci. 112(2), 277–289 (1993)

2. Csuhaj-Varjú, E., Păun, G., Vaszil, G.: PC grammar systems with five context-free components generate all recursively enumerable languages. Theoret. Comput. Sci. 299(1–3), 785–794 (2003)

3. EATCS Monographs in Theoretical Computer Science;J Dassow,1989

4. Fernau, H.: Closure properties of ordered languages. EATCS Bull. 58, 159–162 (1996)

5. Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Combin. 12(1/2), 117–138 (2007)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars;Fundamenta Informaticae;2021-08-04

2. Improved descriptional complexity results on generalized forbidding grammars;Discrete Applied Mathematics;2021-01

3. Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective;Membrane Computing;2021

4. On the Power of Generalized Forbidding Insertion-Deletion Systems;Descriptional Complexity of Formal Systems;2020