Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems-Reference-Cited by-同舟云学术

Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems

Published:1972-12 Issue:6 Volume:1 Page:233-235
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Rozenberg G.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference6 articles.

1. The unsolvability of the equality problem for sentential forms of context-free languages;Blattner;J. Comp. & Syst. Sciences,1972

2. The mathematical theory of context-free languages;Ginsburg,1966

3. Mathematical models for cellular interactions in development;Lindenmayer;J. Theoret. Biol.,1968

4. Developmental systems and languages;Lindenmayer;Proc. 4 ACM Symp. Theory Comp.,1972

5. The equivalence problem for deterministic TOL-systems is undecidable;Rozenberg;Information Processing Letters,1972

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

1. Preface;Theoretical Computer Science;2012-04

2. Learning a subclass of linear languages from positive structural information;Grammatical Inference;1998

3. On equality of multiplicity sets of regular languages;Theoretical Computer Science;1985

4. Grammars with valuations — a discrete model for self-organization of biopolymers;Discrete Applied Mathematics;1982-06

5. The decidability of the DOL-DTOL equivalence problem;Journal of Computer and System Sciences;1981-02