Complexity of some problems concerningL systems-Reference-Cited by-同舟云学术

Complexity of some problems concerningL systems

Published:1979-12 Issue:1 Volume:13 Page:29-43
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Jones Neil D.,Skyum Sven

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01744286.pdf

Reference20 articles.

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.

2. H. Alt and K. Mehlhorn, Lower bounds for the space complexity of context-free recognition, in S. Michaelson, and R. Milner,Automata, Languages and Programming, (3rd Coll., Edinburgh), University Press, Edinburgh, Scotland, 338–354, 1976.

3. T. Harju, A polynomial recognition algorithm for the EDT0L languages, Elektro. Inform. Kybernetik 13, 169–177, 1977.

4. G. T. Herman and G. Rozenberg,Developmental Systems and Languages, North-Holland, Amsterdan, 1975.

5. J. E. Hopcroft and J. D. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.

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

1. Pumping Lemmas Can be “Harmful”;Theory of Computing Systems;2024-04-05

2. Decision Problems Concerning L Systems;SSRN Electronic Journal;2024

3. Pumping Lemmas Could be 'Harmful';SSRN Electronic Journal;2023

4. Extending regular expressions with homomorphic replacement;RAIRO - Theoretical Informatics and Applications;2010-01-26

5. Decidability of the Finiteness of Ranges of Tree Transductions;Information and Computation;1998-08