Advertisement

Easy solutions are hard to find

  • Stephen L. Bloom
  • David B. Patterson
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)

Abstract

There are two main results in this paper.

A new NP-complete problem is found: given a system (S) of recursion equations, determine whether (S) has a solution in a non-trivial "contraction algebra" in which one of the components is a projection. This problem, which arose in [3] where all solutions of a system of recursion equations in a contraction algebra A were found, is related to the equivalence problem for deterministic pushdown automata.

Secondly, for signatures Σ with a finite number of function symbols of positive rank, the free complete contraction Σ-algebras are shown to be isomorphic to algebras of "Σ-trees". When Σ has an infinite number of function symbols of positive rank, it is shown that there are no free complete contraction Σ-algebras.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.G.Wagner, J.B.Wright, J.B.Thatcher, "Rational algebraic theories and fixed point solutions", Proc. 17th IEEE Symposium on Foundations of computing, Houston (1976), 147–158.Google Scholar
  2. [2]
    S.Arnold, M.Nivat, "Metric interpretation of infinite trees and semantics of nondeterministic recursive programs", Universite de Lille, No. I-T-3-78, 1978.Google Scholar
  3. [3]
    S.L.Bloom, "All solutions of a system of recursion equations in infinite trees and other contraction theories", to appear in J. Comp. Syst. Sci.Google Scholar
  4. [4]
    S.L. Bloom, C.C. Elgot, J.B. Wright, "Vector iteration in pointed iterative theories", SIAM J. Computing, Vol. 9, No. 3 (1980), 525–540.Google Scholar
  5. [5]
    S.A.Cook, "The complexity of theorem-proving procedures", Proc. 3rd Ann. ACM Symp. Theory of Computing, ACM New York, 151–158.Google Scholar
  6. [6]
    B. Courcelle, "A representation of trees by languages, I,II", Theoretical Comp. Sci 6 (1978), 255–279; 7 (1978), 25–55.Google Scholar
  7. [7]
    C.C. Elgot, S.L. Bloom, R. Tindell, "On the algebraic structure of rooted trees", J. Comp. Sys. Sci, 16, No. 3 (1978), 362–399.Google Scholar
  8. [8]
    Z.Manna, Mathematical Theory of Computation, McGraw-Hill, (1974).Google Scholar
  9. [9]
    J. Mycielski, W. Taylor, "A compactification of the algebra of terms", Algebra Universalis 6 (1976), 159–163.Google Scholar
  10. [10]
    M. Nivat, "On the interpreation of recursive polyadic program schemes", Symp. Math. 15 (1975), 255–281.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Stephen L. Bloom
    • 1
  • David B. Patterson
    • 2
  1. 1.Mathematical Sciences DepartmentIBM T.J. Watson Research CenterYorktown Heights
  2. 2.Division of Mathematics and ScienceSt. John's UniversityStaten Island

Personalised recommendations