Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages

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.

No reviews for this publication, yet.