Journal of the ACM Bibliography
Robert McNaughton.
Parenthesis grammars. Journal of the ACM, 14(3):490-500,
July 1967.
[BibTeX entry]
Selected papers that cite this one
- Michael J. Fischer. Some properties of
precedence languages. In Conference Record of ACM Symposium on
Theory of Computing, pages 181-190, Marina del Rey, California,
5-7 May 1969.
- James N. Gray and Michael A. Harrison. On the covering and reduction
problems for context-free grammars. Journal of the ACM,
19(4):675-698, October 1972.
- H. B. Hunt, III, D. J. Rosenkrantz, and T. G. Szymanski. The covering problem for
linear context-free grammars. Theoretical Computer
Science, 2(3):361-382, September 1976.
- Gabriel Istrate. The strong equivalence of
ET0L grammars. Information Processing Letters,
62(4):171-176, 28 May 1997.
- Donald E. Knuth. A
characterization of parenthesis languages. Information and
Control, 11(3):269-289, September 1967.
- Yasubumi Sakakibara. Efficient learning of context-free
grammars from positive structural examples. Information and
Computation, 97(1):23-60, March 1992.
- Kai Salomaa, Derick Wood, and Sheng Yu. Structural equivalence
and ET0L grammars. Theoretical Computer Science,
164(1-2):123-140, 10 September 1996.
Shortcuts: