On growing context-sensitive languages-Reference-Cited by-同舟云学术

On growing context-sensitive languages

Published:1992 Issue: Volume: Page:77-88
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Buntrock Gerhard,Loryś Krzysztof

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55719-9_65.pdf

Reference18 articles.

1. Eric W. Allender. Isomorphisms and 1-L reductions. Journal of Computer and System Sciences, 36:336–350, 1988.

2. Ronald V. Book. On the structure of context-sensitive grammar. International Journal of Computer and Information Sciences, 2:129–139, 1973.

3. Ronald V. Book. On the complexity of formal grammars. Ada Informatica, 9:171–181, 1978.

4. Franz-Josef Brandenburg. On one-way auxiliary pushdown automata. In 3rd GI Conference on theoretical computer science, volume 48 of LNCS, pages 132–144. Springer, 1977.

5. Sang Cho and Dung T. Huynh. Uniform membership for deterministic growing contextsensitive grammars is P-complete. Technical Report UTDCS-5-89, Computer Science Department, University of Texas at Dallas, Richardson, Texas 75083, February 1989.

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

1. 5′→3′ Watson-Crick pushdown automata;Information Sciences;2020-10

2. Non-Recursive Trade-Offs Are “Almost Everywhere”;Computing with Foresight and Industry;2019

3. On Measuring Non-Recursive Trade-Offs;Electronic Proceedings in Theoretical Computer Science;2009-07-30

4. Probabilistic Length-Reducing Two-Pushdown Automata;Theory of Computing Systems;2007-10-27

5. The Boolean Closure of Growing Context-Sensitive Languages;Developments in Language Theory;2006