E. Shamir, Catriel Beeri. Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. In Jacques Loeckx, editor, Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974, Proceedings. Volume 14 of Lecture Notes in Computer Science, pages 27-33, Springer, 1974.
@inproceedings{ShamirB74,
title = {Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages},
author = {E. Shamir and Catriel Beeri},
year = {1974},
tags = {programming languages, completeness, e-science, context-aware, grammar},
researchr = {https://researchr.org/publication/ShamirB74},
cites = {0},
citedby = {0},
pages = {27-33},
booktitle = {Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974, Proceedings},
editor = {Jacques Loeckx},
volume = {14},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-06841-4},
}