Advertisement

Checking stacks and context-free programmed grammars accept p-complete languages

  • E. Shamir
  • C. Beeri
Monday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Keywords

Polynomial Time Turing Machine Conjunctive Normal Form Restricted Version True Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook, S., The complexity of Theorem-Proving Procedures, Conf. Rec. 3rd ACM Symp. on Theory of Computing (1971), 151–158.Google Scholar
  2. 2.
    Karp, R., Reducibility Among Combinatorial Problems, in: Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Editors, Plenum Press, N.Y. (1973), 85–104.Google Scholar
  3. 3.
    Stockmeyer, L. J., A. R. Meyer, Word Problems Requiring Exponential Time: Preliminary Report, Conf. Rec. 5th ACM Symp. on Theory of Computing, (1973), 1–9.Google Scholar
  4. 4.
    Greibach, S., Checking Automata and One-Way Stack Languages, J. of Computer and System Sciences 3 (1969), 196–217.Google Scholar
  5. 5.
    Rosenkrantz, D. J., Programmed Grammars and Classes of Formal Languages, J. of the ACM (1969), 107–131.Google Scholar
  6. 6.
    Hunt, H. B. III, On the Time and Tape Complexity of Languages I, Cornell University, Department of Computer Science, Technical Report No. 73–156, (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • E. Shamir
    • 1
  • C. Beeri
    • 1
  1. 1.Institute of MathematicsThe Hebrew UniversityJerusalemIsrael

Personalised recommendations