On the Decidability of Grammar Problems-Reference-Cited by-同舟云学术

On the Decidability of Grammar Problems

Published:1982-04 Issue:2 Volume:29 Page:429-447
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Hunt H. B.¹

Affiliation:

1. Department of Computer Science, State University of New York at Albany, 1400 Washington Avenue, Albany, NY

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference23 articles.

1. AHo A.V. AND ULLMAN J DThe Theory of Parsing Translauon and Compdmg Vols. 1 2 Prentice-Hall Englewood Cliffs N.J. 1972 1973. AHo A.V. AND ULLMAN J DThe Theory of Parsing Translauon and Compdmg Vols. 1 2 Prentice-Hall Englewood Cliffs N.J. 1972 1973.

2. grammars--An extension of LR(k) grammars;CULIK K.;J. Comput. Syst. ScL,1973

3. GRAY J.N. AND HAggISON M.A. On the covering and reduction problems for context-free grammars. ~ ACM 19 4 (Oct. 1972) 675-698 10.1145/321724.321732 GRAY J.N. AND HAggISON M.A. On the covering and reduction problems for context-free grammars. ~ ACM 19 4 (Oct. 1972) 675-698 10.1145/321724.321732

4. On the Parsing of Deterministic Languages

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

1. Bisimulation Finiteness of Pushdown Systems Is Elementary;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

2. An Approach to Regular Separability in Vector Addition Systems;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

3. REGULAR SEPARABILITY OF ONE COUNTER AUTOMATA;LOG METH COMPUT SCI;2019

4. Separability by piecewise testable languages and downward closures beyond subwords;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

5. Separability by piecewise testable languages is PTime-complete;Theoretical Computer Science;2018-02