A pumping lemma for random permitting context languages-Reference-Cited by-同舟云学术

A pumping lemma for random permitting context languages

Published:2002-01 Issue:1-2 Volume:270 Page:959-967
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ewert Sigrid,van der Walt Andries

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference6 articles.

1. J. Dassow, G. Păun, Regulated rewriting in formal language theory, in: W. Brauer, G. Rozenberg, A. Salomaa (Eds.), EATCS Monographs on Theoretical Computer Science, vol. 18, Springer, Berlin, 1989.

2. J.E. Hopcroft, J.D. Ullman, Introduction to automata theory, languages, and computation, in: M.A. Harrison (Ed.), Addison–Wesley Series in Computer Science, Addison–Wesley, Reading, MA, 1979.

3. An algorithm for the general Petri net reachability problem;Mayr;SIAM J. Comput.,1984

4. More on ET0L systems versus random context grammars;Rozenberg;Inform. Process. Lett.,1976

5. Random context languages;van der Walt;Inform. Process.,1972

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

1. A Pumping Lemma for Permitting Semi-Conditional Languages;International Journal of Foundations of Computer Science;2019-01

2. Describing Resource Allocation to Dynamically Formed Groups with Grammars;Advances in Intelligent Systems and Computing;2018-11-21

3. On the Power of Permitting Semi-conditional Grammars;Developments in Language Theory;2017

4. On some derivation mechanisms and the complexity of their Szilard languages;Theoretical Computer Science;2014-06

5. Chapter 21 Concluding Remarks;Regulated Grammars and Automata;2014